output_description: 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.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: #!/usr/bin/env python3
  
  import sys
  from typing import (
      Any,
      Callable,
      Deque,
      Dict,
      List,
      Mapping,
      Optional,
      Sequence,
      Set,
      Tuple,
      TypeVar,
      Union,
  )
  
  # import time
  # import math
  # import numpy as np
  # import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
  # import random                                # random, uniform, randint, randrange, shuffle, sample
  # import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
  # import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
  # from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
  # from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
  # from collections import defaultdict          # subclass of dict. defaultdict(facroty)
  # from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
  # from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
  # from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
  # from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
  # from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
  # from functools import reduce                 # reduce(f, iter[, init])
  # from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
  # from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
  # from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
  # from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
  # from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
  # from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
  # from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
  from itertools import combinations, combinations_with_replacement
  
  # from itertools import accumulate             # accumulate(iter[, f])
  # from operator import itemgetter              # itemgetter(1), itemgetter('key')
  # from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
  
  
  def main():
      mod = 1000000007  # 10^9+7
      inf = float("inf")  # sys.float_info.max = 1.79e+308
      # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
      sys.setrecursionlimit(10**6)  # 1000 -> 1000000
  
      def input():
          return sys.stdin.readline().rstrip()
  
      def ii():
          return int(input())
  
      def isp():
          return input().split()
  
      def mi():
          return map(int, input().split())
  
      def mi_0():
          return map(lambda x: int(x) - 1, input().split())
  
      def lmi():
          return list(map(int, input().split()))
  
      def lmi_0():
          return list(map(lambda x: int(x) - 1, input().split()))
  
      def li():
          return list(input())
  
      def check_k(n):
          for k in range(2, 10**3):
              if k * (k - 1) > 2 * n:
                  return -1
              if k * (k - 1) == 2 * n:
                  return k
  
      n = ii()
      k = check_k(n)
      if k == -1:
          print("No")
      else:
          print("Yes")
          print(k)
          num = 0
          groups = [[] for _ in range(k)]
          for pattern in combinations(range(k), r=2):
              num += 1
              a, b = pattern
              groups[a].append(num)
              groups[b].append(num)
          for g in groups:
              print(2 * n // k, end=" ")
              print(*g, sep=" ")
  
  
  if __name__ == "__main__":
      main()
  
problem_description: 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.
samples: [{"input": "3", "output": "Yes\n    3\n    2 1 2\n    2 3 1\n    2 2 3\n    \n\nIt can be seen that (S_1,S_2,S_3)=(\\\\{1,2\\\\},\\\\{3,1\\\\},\\\\{2,3\\\\}) satisfies\nthe conditions.\n\n* * *"}, {"input": "4", "output": "No"}]