#include <fstream>
using namespace std;

const int MAX_N = 260;

int N, L, C;
int ind[MAX_N], ans[MAX_N][MAX_N];

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

    f >> N;

    L = N*(N-1)/2, C = N-1;
    for(int i = 1, k = 0; i < N; ++i)
        for(int j = i + 1; j <= N; ++j) {
            ++k;
            ans[i][++ind[i]] = ans[j][++ind[j]] = k;
        }

    g << L << " " << C << "\n";
    for(int i = 1; i <= N; ++i) {
        for(int j = 1; j <= C; ++j)
            g << ans[i][j] << " ";
        g << "\n";
    }

    f.close();
    g.close();

    return 0;
}