#include <cstdio>

const int MAX_N = 300;
const char FIN[] = "lacate.in";
const char FOU[] = "lacate.out";

int A[MAX_N][MAX_N];
int N;

int main()
{
    freopen(FIN, "r", stdin);
    freopen(FOU, "w", stdout);

    scanf("%d", &N);

    printf("%d %d\n", N * (N - 1) >> 1, N - 1);

    for (int i = 1, K = 0; i <= N; i++, printf("\n"))
        for (int j = 1; j <= N; j++)
            if (j != i)
            {
                if (j > i)
                    A[i][j] = A[j][i] = ++K;

                printf("%d ", A[i][j]);
            }

    return 0;
}