*******************************
*** The hack uses generator ***
*******************************

** Command line arguments **
no arguments

** Generated test **
200000
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 1
65 1
66 1
67 1
68 1
69 1
70 1
71 1
72 1
73 1
74 1
75 1
76 1
77 1
78 1
79 1
80 1
81 1
82 1
83 1
84 1
85 1
86...

** Generator source **
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")

#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define FOR(a,b,i) for (int i=a;i!=b;a>b?i--:i++)
#define F0R(a,i) FOR(0,a,i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define allr(a) (a), (a)+sizeof(a)/sizeof(a[0]) 
#define sq(a) (a)*(a)
#define tri(x) (x)*((x)+1)/2
#define ll long long 
#define endl '\n'
#define INF 1e9+5
#define LINF 1e18+5
#define yes cout<<"YES";
#define no cout<<"NO";
#define read(x) cin >> x;
#define read2(x,y) cin >> x >> y;
#define read3(x,y,z) cin >> x >> y >> z;
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
void solve(){
}
int32_t main(){
	fastio;
	cout << 200000 << '\n';
	for (int i=1;i<=200000;i++){
		cout << i << ' ' << 1 << '\n';
	}
}