#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
void YN(bool x){cout<<(x?"Yes":"No")<<endl;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}

bool f(PA a,PA b){return a.F*b.S<a.S*b.F;}
int main(){
  ll N=1000000;
  cout<<N<<endl;
  vector<PA>Q;
  FOR(i,2,700)FOR(j,1,i)if(__gcd(i,j)==1)Q.emplace_back(PA(j,i));
  sort(ALL(Q),f);
  Q.resize(N/8);
  vector<PA>R(N);
  ll x=0,y=0;
  REP(i,N/8)x+=Q[i].F,y+=Q[i].S;
  x=x+y;y=0;
  REP(i,N/8){
    R[i]=PA(x,y);
    x-=Q[i].F;
    y+=Q[i].S;
  }
  R[N/8]=PA(x,y);
  FOR(i,N/8+1,N/4){
    R[i]=R[N/4-i];
    swap(R[i].F,R[i].S);
  }
  REP(i,N/4){
    R[i+N/4]=PA(-R[i].S,R[i].F);
    R[i+N/2]=PA(-R[i].F,-R[i].S);
    R[i+N*3/4]=PA(R[i].S,-R[i].F);
  }
  REP(i,N)cout<<R[i]<<endl;
  return 0;
}