#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
ll qpow(ll a,ll n,ll mod){
	ll ret=1;
	while(n){
		if(n&1) ret=(ret*a)%mod;
		a=(a*a)%mod;
		n>>=1;
	}
	return ret;
}
vector<P> prime_factorize(ll N) {
    vector<P> res;
    for(ll a=2;a*a<=N;++a){
        if(N%a!=0) continue;
        ll ex=0;
        while(N%a==0){
            ++ex;
            N/=a;
        }
        res.push_back({a,ex});
    }
    if(N!=1) res.push_back({N,1});
    return res;
}
ll Euler_phi(ll n){
    vector<pair<ll,ll>> pf=prime_factorize(n);
    ll res=n;
    for(auto p : pf){
        res/=p.first;
        res*=(p.first-1);
    }
    return res;
}
int main(){
	ll n;
	cin >> n;
	cout << 50000 << endl;
	for(int i=0;i<50000;i++){
		cout << n << ' ' << 1000000000000000000ll << endl;
	}
}