#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 100005;
vector<int> ans[MAX_N];

int main()
{
	int N;
	cin >> N;
	int k = -1;
	for (int i = 1; i <= 2*N; ++i)
	{
		if (i * (i-1) == 2 * N) k = i;
	}
	if (k == -1)
	{
		cout << "No" << endl;
		return 0;
	}
	else
	{
		cout << "Yes" << endl;
		cout << k << endl;
		int temp = 1;
		for (int i = 0; i < k; ++i)
		{
			for (int j = i+1; j < k; ++j)
			{
				ans[i].push_back(temp);
				ans[j].push_back(temp);
				temp++;
			}
		}
		rep(i,k)
		{
			cout << k - 1;
			rep(j,k-1)
			{
				cout << " " << ans[i][j];
			}
			cout << endl;
		}
	}
	return 0;
}