#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int N=260;
vector<int> chei[N];

int main()
{
    int n;
    in>>n;
    int l = n*(n-1)/2; //combinari de n luate cate n-2
    out<<l<<' '<<n-1<<'\n';
    int cheie=0;
    for(int i=1; i<=l; i++)
    {
        cheie=cheie%n;
        if(cheie==n-1){
            chei[n-1].push_back(i);
            chei[0].push_back(i);
        }
        else{
            chei[cheie].push_back(i);
            chei[cheie+1].push_back(i);
        }
        cheie+=2;
    }
    for(int i=0; i<n; i++)
    {
        for(auto c: chei[i])
            out<<c<<' ';
        out<<'\n';
    }
    return 0;
}