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.
'''
Created on

@author: linhz
'''
import sys
usedNum=0
n=int(input())
p=[0 for i in range(n+1)]
usedNum=0
if n%4==3 or n%4==2:
    print(-1)
else:
    i=1
    j=n
    a=1
    b=n
    while j>i:
        p[i]=a+1
        p[i+1]=b
        p[j]=b-1
        p[j-1]=a
        i+=2
        j-=2
        a+=2
        b-=2
    if j==i:
        p[i]=a
    ans=""
    for i in range(1,n+1):
        ans+=str(p[i])+" "
    print(ans)