#include <cstdio>
using namespace std;
const int N = 505;
int a[N][N], n;

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

    for(i = 1; i <= n; ++i){
        for(j = 1; j < n; ++j)
            printf("%d ", a[i][j]);
        printf("\n");
    }

    return 0;
}