#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,i,indice,j,v[257][257],sum;

int main()
{
    f>>n;
    g<<n*(n-1)/2<<' '<<n-1<<'\n';
    for(i=n-1;i>=1;i--)
    {
        indice=n-i;
        sum+=i;
        for(j=1;j<=i;j++)
        {
            v[indice][++v[indice][0]]=sum-i+j;
            v[indice+j][++v[indice+j][0]]=sum-i+j;
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=v[i][0];j++) g<<v[i][j]<<' ';
        g<<'\n';
    }
    return 0;
}