#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;
struct node {
  int a, b, c, d;
  node(int _a, int _b, int _c, int _d) : a(_a), b(_b), c(_c), d(_d) {}
};
vector<node> ans;
inline void T(int a, int b, int c, int d) {
  ans.push_back(node(a + d, b + d, c + d, 0));
}
inline void F(int a, int b, int c, int d, int e) {
  ans.push_back(node(a + e, b + e, c + e, d + e));
}
void solve(int n, int d) {
  if (n == 3) {
    T(1, 2, 3, d), T(1, 2, 3, d);
    return;
  }
  if (n == 4) {
    T(1, 2, 4, d), T(2, 1, 3, d), T(3, 2, 4, d), T(4, 1, 3, d);
    return;
  }
  if (n % 2) {
    T(1, 2, 3, d), T(1, 2, 3, d);
    for (int i = 4; i <= n; i += 2) F(1, i, 2, i + 1, d), F(1, i, 2, i + 1, d);
  } else {
    T(1, 2, 3, d), T(1, 2, n, d);
    for (int i = 3; i < n; ++i) F(1, i, 2, i + 1, d);
  }
  solve(n - 2, d + 2);
}
int main() {
  int n;
  cin >> n;
  solve(n, 0);
  cout << int(ans.size()) << endl;
  for (auto& i : ans) {
    if (i.d)
      printf("4 %d %d %d %d\n", i.a, i.b, i.c, i.d);
    else
      printf("3 %d %d %d\n", i.a, i.b, i.c);
  }
  return 0;
}
