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

** Command line arguments **
no arguments

** Generated test **
200000
77778 2
155555 3
33332 4
111109 5
188886 6
66663 7
144440 8
22217 9
99994 10
177771 11
55548 12
133325 13
11102 14
88879 15
166656 16
44433 17
122210 18
199987 19
77764 20
155541 1
33318 2
111095 3
188872 4
66649 5
144426 6
22203 7
99980 8
177757 9
55534 10
133311 11
11088 12
88865 13
166642 14
44419 15
122196 16
199973 17
77750 18
155527 19
33304 20
111081 1
188858 2
66635 3
144412 4
22189 5
99966 6
177743 7
55520 8
133297 9
11074 10
88851 11
16662...

** Generator source **
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)

int solve(){
    ll n = 2e5;
    cout<<n<<endl;
    rep(i,n){
        cout<<((i+1)*77777)%n+1<<" "<<(i+1)%20+1<<endl;
    }
    return  0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
    solve();
}