← 返回题目
题库练习 AND-permutations
← 上一题 下一题 →

A11538 | AND-permutations

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Given an integer $N$ , find two permutations:

1. Permutation $p$ of numbers from 1 to $N$ such that $p_{i}≠i$ and $p_{i}&i=0$ for all $i=1,2,...,N$ .
2. Permutation $q$ of numbers from 1 to $N$ such that $q_{i}≠i$ and $q_{i}&i≠0$ for all $i=1,2,...,N$ .

$&$ is the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND).

输入格式

The input consists of one line containing a single integer $N$ ( $1<=N<=10^{5}$ ).

输出格式

For each subtask, if the required permutation doesn't exist, output a single line containing the word "NO"; otherwise output the word "YES" in the first line and $N$ elements of the permutation, separated by spaces, in the second line. If there are several possible permutations in a subtask, output any of them.

输入输出样例

输入 #1
3
输出 #1
NO
NO
输入 #2
6
输出 #2
YES
6 5 4 3 2 1 
YES
3 6 2 5 1 4
C++ 编辑器
输入
输出