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.
# _
#####################################################################################################################

def main():
    return luckyPermutationOfSize(int(input()))


def luckyPermutationOfSize(n):
    if n == 1:
        return 1

    if n <= 3:
        return -1

    limit = n + 1
    pp = tuple(limit - x for x in range(limit))
    permutation = [0]*limit
    permutation[1], permutation[2], permutation[pp[2]] = 2, pp[1], 1
    if n%2:
        iCurr = -(-n//2)
        permutation[iCurr] = iCurr

    iCurr, value = pp[1], pp[2]
    while iCurr != 2:
        permutation[iCurr] = value
        iCurr, value = pp[value], iCurr

    return ' '.join(map(str, permutation[1:]))


if __name__ == '__main__':
    print(main())
    # main()
    # open('output.txt', 'w').write(main())
