#include "bits/stdc++.h"

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#pragma GCC optimize ("-O3")

using namespace std;

#define DEBUG_IS_VALID

#ifdef DEBUG_IS_VALID
#define DEB 1 
#else
#define DEB 0
#endif
#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;

const int mod=1e9+7,INF=1<<29;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll lmod = 1e9+7,LINF=1LL<<59; 

map<int, int> enumpr(int n) {
    map<int, int> V;
    for (int i = 2; 1LL * i*i <= n; i++) while (n%i == 0) V[i]++, n /= i;
    if (n>1) V[n]++;
    return V;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N; cin >> N ;
  // vl a(N);
  // rep(i,N) cin >> a[i] ;
  // deque<ll> ans;
  // sort(ALL(a));
  // int l,r;
  // ans.push_back(a[0]);
  // l = 1;
  // r = N - 1;
  // while(true){
  //   ans.push_front(a[r--]);
  //   if(l>r) break;
  //   ans.push_back(a[r--]);
  //   if(l>r) break;
  //   ans.push_front(a[l++]);
  //   if(l>r) break;
  //   ans.push_back(a[l++]);
  //   if(l>r) break;
  // }
  // vl x;
  // for(auto u:ans) x.pb(u);
  // dump(x);
  // ll res = 0;
  // rep(i,N-1) res += abs(x[i+1]-x[i]);
  // cout << res << endl;
  for(int i = 2; i*(i-1)/2<=N; i++){
    if(N!=i*(i-1)/2) continue;
    cout << "Yes" << endl;
    cout << i << endl;
    vvi ans(i);
    int cnt = 1;
    REP(k,0,i-1) REP(l,k+1,i){
      ans[k].pb(cnt);
      ans[l].pb(cnt);
      cnt++;
    }
    rep(k,i){
      cout << i-1 << " ";
      rep(l,i-1) cout << ans[k][l] << (l==i-2 ? "\n" : " ");
    }
    return 0;
  }
  cout << "No" << endl;
  return 0;
}


Measured memory_bytes: 2304