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==1:from sys import exit;print(1);exit()
res=[0]*n
res[0]=2
i=0
while i<n:
    x=res[i]-1
    if res[x]>0:
        if x==0:
            if res[x]==n-i:break
        from sys import exit
        print(-1);exit()
    res[x]=n-i
    i=x
if res[n//2]==0:res[n//2]=n//2+1
if 0 in res:print(-1)
else:print(*res)