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.
import sys
input = sys.stdin.readline

n = int(input())
if n == 1:
    print(1)
    exit(0)
elif n % 4 == 2 or n % 4 == 3:
    print(-1)
    exit(0)

d = list(range(1, n+1))
e = d.copy()

for i in range(0, n//2, 2):
    d[i] = i+2
    x = 0
    while x < 4:
        d[d[i]-1] = n - i
        i = d[i] - 1
        x += 1

print(' '.join(map(str, d)))
