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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

#define FOR(i,b,e) for(int i = (b); i < (e); i++)
#define TRAV(x,a) for(auto &x: (a))
#define SZ(x) ((int)x.size())
#define PB push_back
#define X first
#define Y second

const int N = 98;

vi G[N];

void solve(){
    int k;
    cin >> k;
    FOR(i, 0, 32) G[i].PB(i+1);
    G[33] = G[34] = {97};
    for(int i = 35; i < 97; i += 2){
        G[i] = G[i+1] = {i-2, i-1};
    }
    FOR(bit, 0, 32){
        if((k >> bit)&1){
            G[bit+1].PB(bit*2+33);
        }
    }
    cout << N << '\n';
    FOR(i, 0, N){
        FOR(j, 0, 2) cout << (SZ(G[i]) > j ? G[i][j]+1 : -1) << ' ';
        cout << '\n';
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // int tt; cin >> tt;
    // FOR(te, 0, tt)
    solve();
    return 0;
}