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>1):
    print(-1)
else:
    ans=[0]*(n+1)
    i,j,a,b=1,n,1,n
    while(i<j):
        ans[i],ans[j]=a+1,b-1
        ans[i+1],ans[j-1]=b,a
        i+=2
        j-=2
        a+=2
        b+=2
    if(i==j):
        ans[i]=a
    for i in range(1,n+1):
        print(ans[i],end=' ')
        