#include <bits/stdc++.h>
using namespace std;
const long long int N = 5e6 + 10, N2 = 2e5, delta = 10501, mod = 998244353,
                    oo = 1e18, LOG = 20, SQ = 300;
const long double PI = 3.141592653589793;
long long int sz;
vector<long long int> v[N];
void dor3(long long int a, long long int b, long long int c) {
  v[sz] = {a, b, c};
}
void dor4(long long int a, long long int b, long long int c, long long int d) {
  v[sz] = {a, b, c, d};
}
void solve(long long int n) {
  if (n == 3) {
    dor3(1, 2, 3);
    sz++;
    dor3(1, 2, 3);
    sz++;
    return;
  }
  if (n == 4) {
    dor4(1, 2, 3, 4);
    sz++;
    dor4(1, 3, 4, 2);
    sz++;
    dor4(1, 4, 2, 3);
    sz++;
    return;
  }
  solve(n - 2);
  if (n & 1) {
    dor3(1, n - 1, n);
    sz++;
    dor3(1, n - 1, n);
    sz++;
    for (long long int i = 2; i < n - 2; i += 2) {
      dor4(i, n - 1, i + 1, n);
      sz++;
      dor4(i, n - 1, i + 1, n);
      sz++;
    }
    return;
  }
  dor4(1, n - 1, 2, n);
  sz++;
  dor3(1, n - 1, n);
  sz++;
  dor3(2, n - 1, n);
  sz++;
  for (long long int i = 3; i < n - 2; i += 2) {
    dor4(i, n - 1, i + 1, n);
    sz++;
    dor4(i, n - 1, i + 1, n);
    sz++;
  }
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long int n;
  cin >> n;
  solve(n);
  cout << sz << '\n';
  for (long long int i = 0; i < sz; i++) {
    cout << v[i].size() << ' ';
    for (long long int u : v[i]) cout << u << ' ';
    cout << '\n';
  }
  return 0;
}
