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: Wrong Answer)

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = findK(n);
        if(k==-1){
            System.out.println("No");
            System.exit(0);
        }
        int[][] res = new int[k][k-1];
        for(int i=0;i<k-1;i++) res[0][i] = i+1;
        int[] index = new int[k];
        for(int i=0;i<k;i++) index[i]=i;
        for(int row=1;row<k;row++){
            int idx = 0;
            for(int j=0;j<row;j++) res[row][idx++] = res[j][index[j]++];
            if(row==k-1) continue;
            res[row][idx++]=res[row-1][k-2]+1;
            while(idx<k-1){
                res[row][idx] = res[row][idx-1]+1;
                idx++;
            }
        }
        System.out.println("Yes");
        for(int i=0;i<k;i++){
            System.out.print(Integer.toString(k-1)+" ");
            for(int j=0;j<k-1;j++){
                System.out.print(Integer.toString(res[i][j])+" ");
            }
            System.out.println("");
        }
    }
    static int findK(int n){
        int k=1;
        while(k*(k-1)<=2*n){
            if(k*(k-1)==2*n) return k;
            k++;
        }
        return -1;
    }
}