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:
    k = n // 2
    t = [0] * n
    for i in range(0, k, 2):
        t[i] = str(i + 2)
    for i in range(1, k, 2):
        t[i] = str(n - i + 1)
    if n & 1:
        k += 1
        t[k - 1] = str(k)
    for i in range(k, n, 2):
        t[i] = str(n - i - 1)
    for i in range(k + 1, n, 2):
        t[i] = str(i)
    print(' '.join(t))