#include <bits/stdc++.h>

using namespace std;

const int MAXN = 300;

int sol[1 + MAXN][1 + MAXN];

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