#include <stdio.h>

#define N 256

int x[N + 1][N];

int main()
{
	freopen("lacate.in", "r", stdin);
	freopen("lacate.out", "w", stdout);
	int n;
	scanf("%d", &n);
	int L = n * (n - 1) / 2;
	int C = n - 1;
	
	int contor = 0, i, j;
	for(i = 1; i <= n; ++i)
	{
		for(j = 1; j < i; ++j) x[i][j] = x[j][i - 1];
		for(j = i; j <= n - 1; ++j) x[i][j] = ++contor;
	}
	printf("%d %d\n", L, C);
	for(i = 1; i <= n; ++i)
	{
		for(j = 1; j <= n - 1; ++j) printf("%d ", x[i][j]);
		printf("\n");
	}
	return 0;
}