#include <fstream>
using namespace std;

ifstream f("lacate.in");
ofstream g("lacate.out");

int a[300][300], l, c, n, i, j, maxp;

int main()
{   f>>n;
    a[1][1]=a[1][2]=1;
    maxp=1;
    for (i=2; i<n; ++i)
    {   for (j=1; j<=i; ++j)
            a[i][j]=maxp+j;
        for (j=1; j<=i; ++j)
            a[j][i+1]=maxp+j;
        maxp=i+maxp;
    }
    g<<maxp<<' '<<n-1<<'\n';
    for (j=1; j<=n; ++j)
    {   for (i=1; i<n; ++i)
            g<<a[i][j]<<' ';
        g<<'\n';
    }
    return 0;
}