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())
even = []
odd = []
for i in range(1,n+1):
    if i%2==0:
        even.append(i)
    else:
        odd.append(i)
if n%4==0 or n%4==1:
    ans=[0]*n
    temp = n
    for i in range(0, n // 2, 2):
        ans[i] = i+2
        ans[i+1]=temp
        ans[n-i-1]=temp-1
        ans[n-i-2]=i+1
        temp-=2
    if n%4==1:
        ans[n//2]=n//2+1
    print(*ans)
else:
    print(-1)