#include <bits/stdc++.h>

using namespace std;

ifstream fin("lacate.in");
ofstream fout("lacate.out");

const int nmax=256;
int n;
bool v[nmax+6][nmax*nmax/2+5];

int main()
{
    fin>>n;
    fout<<n*(n-1)/2<<" "<<n-1<<"\n";
    int nr=1;
    for(int i=1; i<=n-1; i++)
    {
        for(int j=i+1; j<=n; j++)
        {
            v[i][nr]=1;
            v[j][nr]=1;
            nr++;
        }
    }
    for(int i=1; i<=n; i++)
    {
        vector<int> chei;
        for(int j=1; j<=n*(n-1)/2; j++)
        {
            if(v[i][j]) chei.push_back(j);
        }
        for(auto pi: chei) fout<<pi<<" ";
        fout<<"\n";
    }
    return 0;
}