#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

const int kMaxN = 260;

vector<int> v[kMaxN];

// Fiecare lacat trebuie sa se cupleze cu 2 oameni a.i. sa nu existe 2 lacate care sunt cuplate la fel.
// Sunt Comb(N, 2) moduri diferite de a lua 2 oameni din N => Nr maxim de lacate = N * (N - 1) / 2.
// Nr Chei = 2 * L / N = N - 1.

int main() {
  cin.sync_with_stdio(false);

  ifstream cin("lacate.in");
  ofstream cout("lacate.out");

  int n;
  cin >> n;

  int curr_lacat = 0;
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j <= n; j++) {
      curr_lacat++;
      v[i].pb(curr_lacat);
      v[j].pb(curr_lacat);
    }
  }

  cout << n*(n - 1) / 2 << " " << n - 1 << '\n';
  for (int i = 1; i <= n; i++) {
    for (auto it : v[i]) {
      cout << it << " ";
    }
    cout << '\n';
  }

  return 0;
}