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.
n = int(input())
p = [0] * n

if n == 1:
    print(1)
    exit()

for sh in range(n // 4):
    p[n - sh * 2 - 2] = n - sh * 2
    p[sh * 2] = n - 1 - sh * 2
    p[n - sh * 2 - 1] = 2 + sh * 2
    p[sh * 2 + 1] = 1 + sh * 2

if n % 4 == 1:
    p[n // 2] = n // 2 + 1

if n % 4 == 2:
    print(-1)
    exit()

if n % 4 == 3:
    print(-1)
    exit()

print(" ".join([str(i) for i in p]))