A permutation *p* of size *n* is the sequence *p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*n*</sub>, consisting of *n* distinct integers, each of them is from 1 to *n* (1 ≤ *p*<sub class="lower-index">*i*</sub> ≤ *n*).

A lucky permutation is such permutation *p*, that any integer *i* (1 ≤ *i* ≤ *n*) meets this condition *p*<sub class="lower-index">*p*<sub class="lower-index">*i*</sub></sub> = *n* - *i* + 1.

You have integer *n*. Find some lucky permutation *p* of size *n*.
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — the required permutation size.
# _
#####################################################################################################################

def main():
    return luckyPermutationOfSize(int(input()))


def luckyPermutationOfSize(n):
    if n == 1:
        return 1

    border = n//2
    if border%2:
        return -1

    firstBorder = border + 1
    firstHalf, secondHalf = [], []

    for i in zip(range(2, firstBorder, 2), range(n, border, -2)):
        firstHalf.extend(i)

    for j in zip(range(1, firstBorder, 2), range(n-1, border, -2)):
        secondHalf.extend(j)

    if n%2:
        firstHalf.append(firstBorder)

    return ' '.join(map(str, firstHalf + secondHalf))


if __name__ == '__main__':
    print(main())
    # main()
    # open('output.txt', 'w').write(main())
