AND-permutations
Given an integer *N*, find two permutations:
 1.  Permutation *p* of numbers from 1 to *N* such that *p**i*<=≠<=*i* and *p**i*<=&amp;<=*i*<==<=0 for all *i*<==<=1,<=2,<=...,<=*N*. 1.  Permutation *q* of numbers from 1 to *N* such that *q**i*<=≠<=*i* and *q**i*<=&amp;<=*i*<=≠<=0 for all *i*<==<=1,<=2,<=...,<=*N*. 
&amp; 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*<=≤<=105).
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.
none