import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format, std.datetime;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    long k = 1;
    while (k * (k - 1) / 2 < N)
        k++;
    if (k * (k - 1) / 2 != N)
    {
        writeln("No");
        return;
    }
    writeln("Yes");
    writeln(k);
    foreach (i; 0 .. k - 1)
    {
        auto ans = new long[](k);
        ans[0] = k - 1;
        foreach (j; 0 .. i)
        {
            long base = (i) * (i + 1) / 2;
            ans[j + 1] = base + j + 1;
        }
        foreach (j; 0 .. k - i - 1)
        {
            long base = (j + i) * (j + i + 1) / 2 + 1;
            ans[i + j + 1] = base + i;
        }
        ans.to!(string[]).join(' ').writeln();
    }
    auto ans = new long[](k);
    ans[0] = k - 1;
    foreach (i; 0 .. k - 1)
    {
        ans[i + 1] = (i + 1) * (i + 2) / 2;
    }
    ans.to!(string[]).join(' ').writeln();
}
