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
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'      // UWAGA
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
#define random_shuffle(V) shuffle(V, rng)

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "

mt19937 rng((unsigned int)chrono::steady_clock::now().time_since_epoch().count());
int R(int a, int b) {return (int)(rng()%(b-a+1)) + a;}
// #pragma GCC optimize("Ofast")
// while (clock()<=69*CLOCKS_PER_SEC)

VI V[65];
void add(int a, int b)
  {
  V[a].PB(b);
  }
int main()
  {
  ios_base::sync_with_stdio(0);
  int k;
  cin >> k;

  int n = 30 * 2 + 1;
  cout << n << endl;
  REP(i, n/2)
    {
    add(i * 2, i * 2 + 1);
    if(i + 1 != n / 2)add(i * 2, i * 2 + 2);
    if(i + 1 != n / 2)add(i * 2 + 1, i * 2 + 2);
    if((1 << i) & k)add(i * 2 + 1, n - 1);
    }
  REP(i, n)
    {
    cout << (V[i].size() >= 1 ? V[i][0] + 1 : -1) << " ";
    cout << (V[i].size() >= 2 ? V[i][1] + 1 : -1) << endl;
    }

  }