#include <bits/stdc++.h>
using namespace std;
int n;
struct Node {
  int len, t[4];
  Node() {}
  Node(int a, int b, int c) {
    len = 3;
    t[0] = a;
    t[1] = b;
    t[2] = c;
  }
  Node(int a, int b, int c, int d) {
    len = 4;
    t[0] = a;
    t[1] = b;
    t[2] = c;
    t[3] = d;
  }
  void print() {
    printf("%d ", len);
    for (int i = 0; i < len; i++) printf("%d ", t[i]);
    printf("\n");
  }
};
vector<Node> ans;
void solve(int x) {
  if (x <= 4) {
    if (x == 3) {
      ans.push_back(Node(1, 2, 3));
      ans.push_back(Node(1, 2, 3));
    } else {
      ans.push_back(Node(1, 2, 3, 4));
      ans.push_back(Node(1, 2, 4, 3));
      ans.push_back(Node(1, 3, 2, 4));
    }
    return;
  }
  for (int i = x - 2; i >= 3; i -= 2) {
    ans.push_back(Node(x - 1, i, x, i - 1));
    ans.push_back(Node(x - 1, i, x, i - 1));
  }
  if (x & 1) {
    ans.push_back(Node(x - 1, 1, x));
    ans.push_back(Node(x - 1, 1, x));
  } else {
    ans.push_back(Node(x - 1, 1, x));
    ans.push_back(Node(x - 1, 2, x));
    ans.push_back(Node(x - 1, 1, x, 2));
  }
  solve(x - 2);
}
int main() {
  cin >> n;
  solve(n);
  printf("%d\n", ans.size());
  for (unsigned int i = 0; i < ans.size(); i++) ans[i].print();
  return 0;
}
