1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <bits/stdc++.h>
using namespace std;

const int N = 105;
vector<int> G[N];

void solve(int k) {
  int v = 1;

  while (k > 0) {
    if (k % 2 == 1) {
      G[v].push_back(v + 1);
      if (k > 1) {
        G[v].push_back(N);
      }
      v++;
      k--;
    }
    else {
      G[v].push_back(v + 1);
      G[v].push_back(v + 2);
      G[v + 1].push_back(v + 2);
      v += 2;
      k /= 2;
    }
  }

  cout << v << "\n";
  for (int i = 1; i <= v; i++) {
    for (int u : G[i]) {
      if (u == N) {
        cout << v << " ";
      }
      else {
        cout << u << " ";
      }
    }
    for (int j = 0; j < 2 - (int)G[i].size(); j++) {
      cout << "-1 ";
    }
    cout << "\n";
  }
}

int main() {
  ios_base::sync_with_stdio(false);

  int k;
  cin >> k;

  solve(k);
}