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

** Command line arguments **
no arguments

** Generated test **
200000
42 20
18468 20
6335 20
26501 20
19170 20
15725 20
11479 20
29359 20
26963 20
24465 20
5706 20
28146 20
23282 20
16828 20
9962 20
492 20
2996 20
11943 20
4828 20
5437 20
32392 20
14605 20
3903 20
154 20
293 20
12383 20
17422 20
18717 20
19719 20
19896 20
5448 20
21727 20
14772 20
11539 20
1870 20
19913 20
25668 20
26300 20
17036 20
9895 20
28704 20
23812 20
31323 20
30334 20
17674 20
4665 20
15142 20
7712 20
28254 20
6869 20
25548 20
27645 20
32663...

** Generator source **
/*

*/
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
 
#include <bits/stdc++.h>
 
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ff first
#define ss second
#define ins insert
#define sz(x) (int)x.size()
#define dbg(x) cout << x << "\n";
 
const int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
const long long int Mod = 998244353;
const long double Pi = acos(-1);
const long long int Inf = 4e18;
const long double Eps = 1e-9;
 
int dx[9] = {0, 1, -1, 0, 0, 1, 1, -1, -1};
int dy[9] = {0, 0, 0, 1, -1, 1, -1, 1, -1};
 
using namespace std;
 
void TestCase (){
        cout << 200000 << "\n";
        for(int i = 1; i<=200000; i++){
                cout << 1 + rand() % 200000 << " " << 20 << "\n";
        }
}
 
int main(){
        IOS;
        int T = 1;
        // cin >> T;
        while(T--){
                TestCase();
                cout << "\n";
        }
        return 0;
}