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

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    int N = scanner.nextInt();
    int k = -1;
    for (int i = 2; i * (i - 1) <= 2 * N; i++) {
      if (i * (i - 1) == 2 * N) {
        k = i;
        break;
      }
    }
    if (k < 0) {
      System.out.println("No");
      return;
    }

    System.out.println("Yes");
    System.out.println(k);
    List<Integer>[] edges = new List[k];
    for (int i = 0; i < k; i++) edges[i] = new ArrayList<>();

    int e = 1;
    for (int offset = 1; offset <= (k - 1) / 2; offset++) {
      for (int i = 0; i < k; i++) {
        edges[i].add(e);
        edges[(i + offset) % k].add(e);
        e++;
      }
    }

    if (k % 2 == 0) {
      for (int i = 0; i < k / 2; i++) {
        edges[i].add(e);
        edges[i + k / 2].add(e);
        e++;
      }
    }

    StringBuilder sb = new StringBuilder();
    for(List<Integer> ed : edges) {
      sb.append(ed.size()).append(" ");
      for(int i : ed) sb.append(i).append(" ");
      sb.append("\n");
    }
    System.out.println(sb.toString());
  }
}