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)

    exit()



a = [i for i in range(0, n+1)]

for i in range(1, n//2+1, 2):

    p, q, r, s = i, i+1, n-i,n-i+1

    a[p], a[q], a[r], a[s] = a[q], a[s], a[p], a[r]



def check(arr):

    for i in range(1, n+1):

        k = arr[i]

        if arr[arr[k]] != n-k+1:

            return False

    return True



# print(check(a))

print(*a[1:])

