A set consisting of positive integers is called , if after arbitrarily deleting one of its elements, the remaining set can be divided into two subsets with equal sum.

Given a positive integer , please construct an interesting set with exactly elements, or report that it is impossible. To simplify the checking progress, you need to point out the approach of dividing the set when each of the elements is deleted, if there exists a solution.

输入描述:

The first and only line of input contains a single integer , the requiring size of the set.

输出描述:

If there is no solution, print a single .

Otherwise, print a single  in the first line. The second line should contains  space-separated integers , denoting the elements of the set. The integers must be pairwise distinct. It can be shown that if a solution exists, there must be a solution with all .

After that, for each  from  to , print a line to give out your division of subsets when the -th element is deleted. The line should begin with a number  denoting the size of one of the subset, followed by  pairwise distinct integers  denoting the indices of elements of the subset.  must be held. The checker will automatically computes the other subset and check whether they have equal sums.

6

NO

7

YES
1 3 5 7 9 11 13 
4 2 3 4 5 
3 1 5 7 
4 1 2 4 6 
3 2 3 7 
2 4 7 
3 2 4 5 
4 1 2 3 5

For the first example, it can be proved that there is no solution with .

For the second example,  is an interesting set. For example, if you delete  from the set, you can divide the remaining set into  and  with , and when deleting  from the set, we have .

Note that you can print  in arbitrary order, not necessarily sorted. The sample output above sorts them for better reading experience. The same goes for .