#include <bits/stdc++.h>

using namespace std;

#define MAXN 260

int N;
int A[MAXN][MAXN];
int B[MAXN];

int main() {
	freopen("lacate.in", "r", stdin);
	freopen("lacate.out","w", stdout);
	cin.sync_with_stdio(false);
	
	cin >> N;
	int L = 0;
	for (int i = 0; i < N - 1; i++) {
		for (int j = i + 1; j < N; j++) {
			A[i][B[i]++] = L;
			A[j][B[j]++] = L;
			L++;
		}
	}
	
	cout << L << ' ' << N - 1 << '\n';
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N - 1; j++) {
			if (j > 0) {
				cout << ' ';
			}
			cout << A[i][j] + 1;
		}
		cout << '\n';
	}
	
	return 0;
}