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
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>

using namespace std;

const int nax = 101;

pii ans[nax];

int main()
{
    int k; cin>>k;
    for(int i=0;i<nax;i++) ans[i] = mp(-1,-1);
    for(int i=1;i<=35;i++)
    {
        ans[i * 2 - 1].st = i * 2;
        ans[i * 2 - 1].nd = i * 2 + 1;
        ans[i * 2].st = i * 2 + 1;
    }


    for(int i=0;i<=29;i++)
    {
        if(k & (1<<i))
        {
            ans[(i+1) * 2].nd = 100;
        }
    }
    cout<<100<<"\n";
    for(int i=1;i<=100;i++)
    {
        cout<<ans[i].st<<" "<<ans[i].nd<<endl;
    }

    return 0;
}