#include <bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std;

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

const int MAX_N = 256;
int n, L, C;
vector<int> key[MAX_N + 5];

int main (){
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr), fout.tie(nullptr);

    fin>>n;
    L = n * (n-1) / 2;
    C = n-1;

    fout<<L<<" "<<C<<"\n";

    int k = 0;
    for(int i=1; i < n; i++)
        for(int j=i+1; j<=n; j++){
            k++;
            key[i].push_back(k);
            key[j].push_back(k);
        }

    for(int i=1; i<=n; i++, fout<<"\n")
        for(auto k : key[i])
            fout<<k<<" ";
    return 0;
}
/**
oricare n-2 membrii au o cheie lipsa
=>
L = 1 cheie lipsa * nr moduri de a alege n-2 membrii
  = 1 * C(n, n-2)
  = n * (n-1) / 2

n = 4
L = 6

**/