#include <bits/stdc++.h>
using namespace std;
int a[180000], b[180000], c[180000], d[180000], k;
void solve(int n) {
  int i, j;
  if (n == 4) {
    a[++k] = 1;
    b[k] = 2;
    c[k] = 3;
    a[++k] = 2;
    b[k] = 3;
    c[k] = 4;
    a[++k] = 1;
    b[k] = 3;
    c[k] = 4;
    a[++k] = 1;
    b[k] = 2;
    c[k] = 4;
    return;
  }
  if ((n - 2) & 1) {
    for (i = 1; i <= (n - 3); i++)
      if (!(i & 1))
        for (j = 0; j <= (1); j++) {
          a[++k] = n - 1;
          b[k] = i - 1;
          c[k] = n;
          d[k] = i;
        }
    for (j = 0; j <= (1); j++) {
      a[++k] = n - 1;
      b[k] = n - 2;
      c[k] = n;
    }
  } else {
    for (i = 1; i <= (n - 4); i++)
      if (!(i & 1))
        for (j = 0; j <= (1); j++) {
          a[++k] = n - 1;
          b[k] = i - 1;
          c[k] = n;
          d[k] = i;
        }
    a[++k] = n - 1;
    b[k] = n - 3;
    c[k] = n;
    d[k] = n - 2;
    a[++k] = n - 1;
    b[k] = n - 3;
    c[k] = n;
    a[++k] = n - 1;
    b[k] = n - 2;
    c[k] = n;
  }
  if (n > 3) solve(n - 2);
}
int main() {
  int n, i;
  scanf("%d", &n);
  solve(n);
  printf("%d", k);
  for (i = 1; i <= (k); i++)
    if (d[i])
      printf("\n4 %d %d %d %d", a[i], b[i], c[i], d[i]);
    else
      printf("\n3 %d %d %d", a[i], b[i], c[i]);
  return 0;
}
