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
53
54
55
56
57
58
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 3e5+5;
const int M = 3e4+5;
const ll INF = (ll)(1e18);
const int inf = 2e9;
const ll MOD = 1000000007LL;

int k;
vector<int> G[105];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
		
	cin >> k;
	int maxBit = -1;
	for (int bit = 30; bit >= 0; bit--) {
		if (k & (1 << bit)) {
			maxBit = bit;
			break;
		}
	}
	
	int cur = 1;
	for (int i = 0; i <= maxBit; i++) {
		G[cur].push_back(cur+1);
		G[cur].push_back(cur+2);
		G[cur+1].push_back(cur+2);
		cur += 2;
	}
	
	int tmp = 2;
	for (int i = 0; i <= maxBit; i++) {
		if (k & (1 << i)) {
			G[tmp].push_back(cur+1);
		}
		tmp += 2;
	}
	
	cout << cur+1 << '\n';
	for (int i = 1; i <= cur+1; i++) {
		while ((int)G[i].size() < 2) G[i].push_back(-1);
		for (int to: G[i]) cout << to << ' ';
		cout << '\n';
	}
	
	
    return 0;
}