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)

//intのオーバーフローに気をつけろ,AGCはだいたいlongにしておけ
//毎回余りを求めることでオーバーフローしなくなる
//nextLineよりnextだ
//charは''で囲うんだぞ
//読み込みは先に全部やっておけ
//for文を回す回数に気をつけろ
	//for文は10^3の三重はTLE,10^5の二重はTLE,10^9のforはTLE
//貪欲は使えるか？？試した？？

import java.util.Scanner;

public class Main {

	public static void main(String args[]) throws InterruptedException {
		    Scanner sc = new Scanner(System.in);

		    int n = sc.nextInt();
		    //2*nが連続する2整数の積で表されたとき行けるっぽい.
		    int i = 1;
		    int count = 0;
		    while(i * (i+1) <= 2*n) {
		    	if(i*(i+1)==2*n) {
		    		count++;
		    		break;
		    	}else {
		    		i++;
		    		continue;
		    	}
		    }

	    	int[][] array  = new int[i][i+1];
		    if(count == 0 ) {
		    	System.out.println("No");
		    }else {
		    	System.out.println("Yes");
		    	System.out.println(i+1);
		    	for(int j = 0; j < i; j++) {
		    		for(int k = 0; k < i+1; k++) {
		    			if( j >= k)//オリジナル
		    				array[j][k] = j + i*k - k*(k+1)/2 + 1;
		    			
		    		}
		    	}
		    	for(int j = 0; j < i; j++) {
		    		for(int k = 0; k < i+1; k++) {
		    			if( j < k)
		    				array[j][k] = array[k-1][j];
		    			
		    		}
		    	}

			    for(int k = 0; k < i+1; k++) {
			    	System.out.print(i);
			    	for(int j = 0; j < i; j++) {
			    		System.out.print(" "+ array[j][k]);
			    	}
			    	if(k < i) {
			    			System.out.print("\n");
			    		}
			    }
		    }
		    
		    
		    
		    sc.close(); }

	public static void saiki(int a, String b) {
		//再帰コーディングのお手本

		if(a == 0) {
			System.out.println(b);
		}else {
			for(char ch = 'a'; ch <= 'c'; ch++) {
				saiki(a-1,b + ch);
			}
		}
	}

	public static  int gcd(int a, int b) {
	    if (a < b) {
	        int tmp = a;
	        a = b;
	        b = tmp;
	    }

	    int r = -1;
	    while (r != 0) {
	        r = a % b;
	        a = b;
	        b = r;
	    }

	    return a;
	}
}