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
71
72
73
74
75
76
77
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,mmx,abm")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
typedef long long lld;
typedef double lf;
typedef long double llf;
typedef pair<int,int> pii;
typedef pair<lld,lld> pll;
#define For(i,s,a) for(int i = (int)s; i < (int)a; ++i)
#define rpt(s, it) for(auto it = s.begin(); it != s.end(); ++it)
#define brpt(s, it) for(auto it = s.rend(); it != s.rbegin(); --it)
#define sz size()
#define pb push_back
#define eb emplace_back
#define ff first
#define dd second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ZAPS {int t; scanf("%i", &t); while(t--) solve();}
#define make_unique(x) (x).erase( unique(all(x)), (x).end())


template<typename Ta, typename Tb>
ostream & operator <<(ostream & os, pair<Ta, Tb> x){
	return os << x.ff << " " << x.dd;
}

int lef[101], rig[101];
int sum[101];

int dfs(int x){
	if(x == 100)
		return 1;
	return (lef[x] == -1? 0 : dfs(lef[x])) + (rig [x] == -1 ? 0 : dfs(rig[x]));
}

int32_t main(void){
	For(i, 1, 101)
	lef[i] = rig[i] = -1;
	lef[100] = rig[100] = -1;
	sum[100] = 1;
	lef[99] = 100;
	rig[99] = -1;
	sum[99] = 1;
	int wsk = 98;
	for(; wsk && (lld)sum[wsk + 1] + (lld)sum[wsk + 2] <= 2000000000ll; --wsk){
		lef[wsk] = wsk + 1;
		rig[wsk] = wsk + 2;
		sum[wsk] = sum[wsk + 1] + sum[wsk + 2];
	}
	++wsk;
	int k;
	scanf("%d", &k);
	int pt = 1;
	while(k){
		while(sum[wsk] > k)
			++wsk;
		//cout<<k<<" "<<wsk<<" "<<sum[wsk]<<endl;
		lef[pt] = pt + 1;
		rig[pt] = wsk;
		k -= sum[wsk];
		if(!k)
			lef[pt] = -1;
		++pt;
	}
	puts("100");
	For(i, 1, 101)
		printf("%d %d\n", lef[i], rig[i]);
	//cout<<dfs(1)<<endl<<endl;	
}

/*
5
2 7 4 4 1
*/