#include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn = 1e5 + 11;
int a[1000][1000];
int main(){
	int n; cin >> n;
	int i;
	bool flag = 1;
	for(i = 1;i < 1e3;i++){
		if(i * (i+1) == 2*n) break;
		if(i*(i+1) > 2*n) {flag = 0;break;}
	}
	if(!flag) cout << "No" << endl;
	else {
		int x = 1;
		for(int j = 1;j <= i;j++){
			for(int k = j;k <= i;k++){
				a[j][k] = x;
				a[k+1][j] = x++;
			}
		}
		cout << "Yes" << endl << i+1 << endl;
		for(int j = 1;j <= i+1;j++){
			cout << i;
			for(int k = 1;k <= i;k++)
				cout << " " << a[j][k];
			cout << endl;
		}
	}
	return 0;
}










