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.io.PrintStream;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {
    private static final PrintStream so = System.out;
    private static final Scanner     sc = new Scanner(System.in);
    private static List<Integer> list;
    private static Map<Integer, Integer> map;
    
    public static void main(String[] args) {
        make();
        
        int n = sc.nextInt();
        if (!list.contains(n)) {
            so.println("no");
            return;
        }
        
        so.println("yes");
        int w = map.get(n);
        int h = w + 1;
        int a = 1;
        int b = 1;
        int[][] lists = new int[h][w];
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (i <= j) {
                    lists[i][j] = a++;
                }
            }
        }
        for (int j = 0; j < w; j++) {
            for (int i = 0; i < h; i++) {
                if (i > j) {
                    lists[i][j] = b++;
                }
            }
        }
        print(lists);
    }
    
    static void print(int[][] list) {
        so.println(list.length);
        for (int i = 0; i < list.length; i++) {
            so.print(list[i].length + " ");
            for (int j = 0; j < list[i].length; j++) {
                so.print(list[i][j]);
                if (j != list[i].length - 1) {
                    so.print("");
                }
            }
            so.println();
        }
    }

    static private void make() {
        list = new ArrayList<>();
        map = new HashMap<>();
        
        for (int i = 2; ; i++) {
            if (i * (i + 1) > 200000) {
                break;
            }
            list.add(i * (i+1) / 2);
            map.put(i * (i+1) / 2, i);
        }
    }
    
}