← 返回题目

题库练习 Permutation of Given

← 上一题下一题 →

A16393 | $Permutation of Given$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You were given only one number, $n$ . It didn't seem interesting to you, so you wondered if it's possible to come up with an array of length $n$ consisting of non-zero integers, such that if each element of the array is replaced by the sum of its neighbors (the elements on the ends are replaced by their only neighbors), you obtain a permutation of the numbers in the original array.

输入格式

Each test case contains only one number, $n$ ( $2 \leq n \leq 10^6$ ).

输出格式

If a solution exists, output "YES" (without quotes), followed by an array $a$ ( $-10^9 \leq a_i \leq 10^9, a_i \neq 0$ ) that satisfies the condition of the problem. If there are multiple possible answers, output any of them. If there is no suitable array, output "NO" (without quotes). The words "YES" and "NO" can be output in any case, for example, "YES", "Yes", "yEs", and so on.

输入输出样例

输入 #1

输出 #1

YES
1 2 -2 -1

输入 #2

输出 #2

NO

C++ 编辑器

输入

输出