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())
if n%4==2 or n%4==3:
    from sys import exit
    print(-1);exit()
res,i=[0]*n,0
for i in range(0,n//2,2):
    res[i],res[i+1]=i+2,n-i
    res[n-i-1],res[n-i-2]=n-i-1,i+1
    i+=2
if n%4==1:res[n//2]=n//2+1
print(*res)