#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;

int main(){
    ll N;
    cin >> N;
    ll k=sqrt(2*N)+1;
    if(k*(k-1)!=2*N){cout<<"No"<<endl;return 0;}
    cout<<"Yes"<<endl;
    cout<<k<<endl;
    vector<vector<ll>> S(k, vector<ll>(0));
    ll t=1;
    for(ll i=0;i<k-1;i++){
     for(ll j=i+1;j<k;j++){
         S[i].emplace_back(t);
         S[j].emplace_back(t);
         t++;
     ;}
    ;}
    for(ll i=0;i<k;i++){
        cout<<k-1;
        for(ll j=0;j<S[i].size();j++){
            cout<<" "<<S[i][j]
        ;}
        cout<<endl;
    ;}
    
    return 0;
}
