#include <bits/stdc++.h>
using namespace std;
int n, i, j, ans;
vector<int> a[90005];
inline void in(int x, int y, int z) {
  a[++ans].push_back(x);
  a[ans].push_back(y);
  a[ans].push_back(z);
}
inline void IN(int x, int y, int z, int w) {
  in(x, y, z);
  a[ans].push_back(w);
}
int main() {
  scanf("%d", &n);
  if (n & 1) {
    in(1, 2, 3);
    in(1, 2, 3);
    for (i = 5; i <= n; i += 2) {
      in(i - 1, 1, i);
      in(i - 1, 1, i);
      for (j = 3; j < i; j += 2) IN(i - 1, j - 1, i, j), IN(i - 1, j - 1, i, j);
    }
  } else {
    in(1, 2, 3);
    in(1, 2, 4);
    in(1, 3, 4);
    in(2, 3, 4);
    for (i = 6; i <= n; i += 2) {
      in(i - 1, 1, i);
      in(i - 1, 2, i);
      IN(i - 1, 1, i, 2);
      for (j = 4; j < i; j += 2) IN(i - 1, j - 1, i, j), IN(i - 1, j - 1, i, j);
    }
  }
  printf("%d\n", ans);
  for (i = 1; i <= ans; ++i, puts("")) {
    printf("%d", a[i].size());
    for (j = 0; j < a[i].size(); ++j) printf(" %d", a[i][j]);
  }
  return 0;
}
