F. AND-permutationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven an integer N, find two permutations:  Permutation p of numbers from 1 to N such that pi ≠ i and pi & i = 0 for all i = 1, 2, ..., N.  Permutation q of numbers from 1 to N such that qi ≠ i and qi & i ≠ 0 for all i = 1, 2, ..., N. & is the bitwise AND operation.InputThe input consists of one line containing a single integer N (1 ≤ N ≤ 105).OutputFor 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.ExamplesInput3OutputNONOInput6OutputYES6 5 4 3 2 1 YES3 6 2 5 1 4
Input3
OutputNONO
['constructive algorithms', '*2500']