F. AND-permutations
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Given an integer N, find two permutations:

1. Permutation p of numbers from 1 to N such that pi ≠ i and pi & i = 0 for all i = 1, 2, ..., N.
2. 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.

Input

The input consists of one line containing a single integer N (1 ≤ N ≤ 105).

Output

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.

Examples
Input
3
Output
NONO
Input
6
Output
YES6 5 4 3 2 1 YES3 6 2 5 1 4