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.*;
public class Main {
    
    public static void main(String args[]){
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();

        HashMap<Integer,Integer> ntoi = new HashMap<>();
        int in = 2;
        while(true){
            int combi = in*(in-1)/2;
            if(combi > 100000){
                break;
            }
            ntoi.put(combi, in);
            in ++;
        }

        if(ntoi.containsKey(N)){
            System.out.println("Yes");
            System.out.println(ntoi.get(N));
            int[][] table = new int[N+1][ntoi.get(N)+1];
            int i=1;
            int j=2;
            int k=1;
            while(k <= N) {
                table[k][i] = 1;
                table[k][j] = 1;
                if(j+1 <= ntoi.get(N)){
                    j++;
                }else{
                    i++;
                    j = i+1;
                }
                k++;
            }
            for (int c = 1; c <= ntoi.get(N); c++) {
                System.out.print(2);
                System.out.print(" ");
                for(int r=1; r<=N; r++){
                    if(table[r][c]==1){
                        System.out.print(r);
                        System.out.print(" ");
                    }
                }
                System.out.println("");
            }
        }else{
            System.out.println("No");
        }
    }
}