← 返回题目

题库练习 Lucky Permutation

← 上一题下一题 →

A8904 | $Lucky Permutation$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

输入 #2

输出 #2

-1

输入 #3

输出 #3

2 4 1 3

输入 #4

输出 #4

2 5 3 1 4

C++ 编辑器

输入

输出