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
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <cstring>

#define REP(a,n) for (int a = 0; a<(n); ++a)
#define FOR(a,b,c) for (int a = (b); a<=(c); ++a)
#define FORD(a,b,c) for (int a = (b); a>=(c); --a)
#define FOREACH(a,v) for (auto a : v)

#define MP make_pair
#define PB push_back

template<class T> inline int size(const T&t) { return t.size(); }

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long LL;

///////////////////////////////

#define MOD 1'000'000'007

int k;

int main() {
  cin >> k;
  cout << "90\n";
  FOR(a, 1, 30)
    cout << ((k & (1 << (30 - a))) ? 30 + a : -1) << " " << ((a < 30) ? a + 1 : -1) << endl;
  FOR(a, 31, 60)
    cout << a + 30 << " -1\n";
  FOR(a, 61, 89)
    cout << a - 29 << " " << a + 1 << endl;
  cout << "-1 -1\n";
}