ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

6171: Lucky Permutation

内存限制：256 MB 时间限制：2 S 标准输入输出
题目类型：传统 评测方式：文本比较 上传者：
提交：0 通过：0
提交提交记录统计Web Board

题目描述

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A permutation p of size n is the sequence p1,p2,...,pn, consisting of n distinct integers, each of them is from 1 to n (1≤pi≤n).

A lucky permutation is such permutation p, that any integer i (1≤i≤n) meets this condition ppi=n-i+1.

You have integer n. Find some lucky permutation p of size n.

Input

The first line contains integer n (1≤n≤105) − the required permutation size.

Output

Print "-1" (without the quotes) if the lucky permutation p of size n doesn't exist.

Otherwise, print n distinct integers p1,p2,...,pn (1≤pi≤n) after a space − the required permutation.

If there are multiple answers, you can print any of them.

Examples
Input
1
Output
1
Input
2
Output
-1
Input
4
Output
2 4 1 3
Input
5
Output
2 5 3 1 4