#include <bits/stdc++.h>
using namespace std;
int n, ans;
vector<int> g[200010];
int main() {
  int i, j;
  scanf("%d", &n);
  if (n & 1) {
    for (i = 2; i <= n; i += 2)
      for (j = i + 2; j <= n; j += 2) {
        ans++;
        g[ans].push_back(i);
        g[ans].push_back(j);
        g[ans].push_back(i + 1);
        g[ans].push_back(j + 1);
        ans++;
        g[ans].push_back(i);
        g[ans].push_back(j);
        g[ans].push_back(i + 1);
        g[ans].push_back(j + 1);
      }
    for (i = 2; i <= n; i += 2) {
      ans++;
      g[ans].push_back(1);
      g[ans].push_back(i);
      g[ans].push_back(i + 1);
      ans++;
      g[ans].push_back(1);
      g[ans].push_back(i);
      g[ans].push_back(i + 1);
    }
  } else {
    for (i = 1; i <= n; i += 2)
      for (j = i + 2; j <= n; j += 2) {
        if (i != 1 || j != 3) {
          ans++;
          g[ans].push_back(i);
          g[ans].push_back(j);
          g[ans].push_back(i + 1);
          g[ans].push_back(j + 1);
        }
        if (i != 1) {
          ans++;
          g[ans].push_back(i);
          g[ans].push_back(j);
          g[ans].push_back(i + 1);
          g[ans].push_back(j + 1);
        }
      }
    for (i = 5; i <= n; i += 2) {
      ans++;
      g[ans].push_back(1);
      g[ans].push_back(i);
      g[ans].push_back(i + 1);
      ans++;
      g[ans].push_back(2);
      g[ans].push_back(i);
      g[ans].push_back(i + 1);
    }
    ans++;
    g[ans].push_back(1);
    g[ans].push_back(2);
    g[ans].push_back(3);
    ans++;
    g[ans].push_back(1);
    g[ans].push_back(2);
    g[ans].push_back(4);
    ans++;
    g[ans].push_back(2);
    g[ans].push_back(3);
    g[ans].push_back(4);
    ans++;
    g[ans].push_back(1);
    g[ans].push_back(3);
    g[ans].push_back(4);
  }
  printf("%d\n", ans);
  for (i = 1; i <= ans; i++) {
    printf("%d", g[i].size());
    for (j = 0; j < g[i].size(); j++) printf(" %d", g[i][j]);
    printf("\n");
  }
  return 0;
}
