#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i, n) for(ll i =0; i < ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B>
bool chmax(A& a, B b) { return a<b && (a=b, true); }
template <class A, class B>
bool chmin(A& a, B b) { return b<a && (a=b, true); }

void testcase() {
  int n; cin >> n;
  cout << n*2-3 << '\n';
  REP(i, n-1) {
    cout << i+1 << ' ' << i+2 << ' ' << i*2+1 << '\n';
  }
  REP(i, n-2) {
    cout << 2 << ' ' << i+3 << ' ' << i*2+4 << '\n';
  }
  for(int i = 1; i < n; i++) for(int j = i+1; j <= n; j++) {
    if(i == 1) {
      cout << j-1;
      REP(k, j-1) cout << ' ' << k+1;
      cout << '\n';
    } else {
      cout << j-2;
      REP(k, i-2) cout << ' ' << i-1-k;
      cout << ' ' << i+n-2;
      REP(k, j-i-1) cout << ' ' << i+1+k;
      cout << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  testcase();
}