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.
import sys

def read(T=int,s=" "):
	return [T(i) for i in sys.stdin.readline().split(s)]

def main():
	n=read()[0]
	"""
		either 4n or 4n + 1 uwu?
	"""
	if n%4!=1 and n%4!=0:
		print(-1)
		return
	res=[(n+1)//2 for i in range(n)]
	for i in range(0,n//2,2):
		x,y,z,w=[i,i+1,n-2-i,n-1-i]
		res[x]=y+1
		res[y]=w+1
		res[w]=z+1
		res[z]=x+1

	for i in range(0,n):
		print(res[i],end=" ")
	print()
		
main()
 	 	 	   	 	  			 						 	  		