Problem:
Score : 500 points

Problem Statement

You are given an integer N. Determine if there exists a tuple of subsets of \{1,2,...N\}, (S_1,S_2,...,S_k), that satisfies the following conditions:

Each of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.

Any two of the sets S_1,S_2,...,S_k have exactly one element in common.

If such a tuple exists, construct one such tuple.

Constraints

1 \leq N \leq 10^5

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If a tuple of subsets of \{1,2,...N\} that satisfies the conditions does not exist, print No.
If such a tuple exists, print Yes first, then print such subsets in the following format:

k
|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}
:
|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}

where S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.

If there are multiple such tuples, any of them will be accepted.

Sample Input 1

3

Sample Output 1

Yes
3
2 1 2
2 3 1
2 2 3

It can be seen that (S_1,S_2,S_3)=(\{1,2\},\{3,1\},\{2,3\}) satisfies the conditions.

Sample Input 2

4

Sample Output 2

No

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int els = 0;
		
		if(n == 1)
		{
			System.out.println("Yes");
			System.out.println("2");
			System.out.println("1 1");
			System.out.println("1 1");
			return;
		}

		int canner = 1;
		for(int i = 2; canner <= 100000; i++)
		{
			canner += i;
//			System.out.println(canner);
			if(canner == n)
			{
				System.out.println("Yes");
				els = i;
				break;
			}
		}
		if(els == 0)
		{
			System.out.println("No");
			return;
		}
		
		System.out.println((els+1));
		
		int[][] table = new int[els][els+1];
		
		int curstart = 1;
		int curend = 0;
		for(int offset = 0; offset < els; offset++)
		{
			for(int x = offset; x < els; x++)
			{
				table[x][offset] = curstart+(x-offset);
				
				curend = curstart+x-offset;
			}
			for(int y = offset+1; y <= els; y++)
			{
				table[offset][y] = (curstart+y-1-offset);
			}
			
			curstart = curend+1;
		}
		
		StringBuilder sb = new StringBuilder();
		
		for(int y = 0; y <= els; y++)
		{
			sb.append(els + " ");
			for(int x = 0; x < els; x++)
			{
				if(x>0)sb.append(' ');
				sb.append(table[x][y]);
			}
			sb.append('\n');
		}
		
		System.out.print(sb);

	}

}