Lucky Permutation

题意翻译

输入一个数$n$，输出长度为$n$的“幸运数列”，如果没有就输出“$-1$” 如果数组$p$是一个“幸运数列”，那么满足对与每一个i都有 $ p_{p_i} = n-i+1$

题目描述

A permutation $ p $ of size $ n $ is the sequence $ p_{1},p_{2},...,p_{n} $ , consisting of $ n $ distinct integers, each of them is from $ 1 $ to $ n $ $ (1<=p_{i}<=n) $ . A lucky permutation is such permutation $ p $ , that any integer $ i $ $ (1<=i<=n) $ meets this condition $ p_{pi}=n-i+1 $ . You have integer $ n $ . Find some lucky permutation $ p $ of size $ n $ .

输入输出格式

输入格式

The first line contains integer $ n $ ( $ 1<=n<=10^{5} $ ) — the required permutation size.

输出格式

Print "-1" (without the quotes) if the lucky permutation $ p $ of size $ n $ doesn't exist. Otherwise, print $ n $ distinct integers $ p_{1},p_{2},...,p_{n} $ $ (1<=p_{i}<=n) $ after a space — the required permutation. If there are multiple answers, you can print any of them.

输入输出样例

输入样例 #1

1

输出样例 #1

1 

输入样例 #2

2

输出样例 #2

-1

输入样例 #3

4

输出样例 #3

2 4 1 3 

输入样例 #4

5

输出样例 #4

2 5 3 1 4