21061번 - Beautiful Permutation 스페셜 저지다국어

문제

A permutation $a_0, a_1, \ldots, a_{n - 1}$ of 0,ドル 1, \ldots, n - 1$ is said to be beautiful if the sequence $b_0, \ldots, b_{n - 1}$ defined as $b_i = |a_i - i|$ is also a permutation of 0,ドル \ldots, n - 1$.

Given $n,ドル construct a beautiful permutation of $n$ elements or determine that it does not exist.

입력

The first line contains a single integer $n$ (1ドル \leq n \leq 10^6$): the size of the permutation.

출력

If there is no beautiful permutation of $n$ elements, output a single line with the word "NO".

Otherwise, on the first line, print "YES", and on the second line, print $n$ space-separated integers $a_0, \ldots, a_{n-1}$: the beautiful permutation. If there are multiple beautiful permutations, print any one of them.

제한

힌트