#include <fstream>
using namespace std;

int n;
int a[257][257];
int L, C;

void read() {
    ifstream f("lacate.in");
    f >> n;
    f.close();
}

void solve() {
    int i, j, nr = 0;
    L = n * (n - 1) / 2;
    C = n - 1;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= C; j++)
            if (i - j >= 2)
                a[i][j] = a[i - 1][j] + 1;
            else if (j - i >= 0)
                a[i][j] = ++nr;
            else a[i][j] = a[i - 1][j];
}   

void output() {
    int i, j;
    ofstream g("lacate.out");
    g << L << ' ' << C << '\n';
    for (i = 1; i <= n; i++, g << '\n')
        for (j = 1; j <= C; j++)
            g << a[i][j] << ' ';
    g.close();
}

int main() {
    read();
    solve();
    output();
    return 0;
}