#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
	while(b)
	{
		int t=a%b;
		a=b;
		b=t;
	}
	return a;
}
int main()
{
	vector<pair<int,int> >A;
	for(int T=2;A.size()<250000;T++)for(int x=1;A.size()<250000&&x<T;x++)
	{
		int y=T-x;
		if(gcd(x,y)==1)A.push_back(make_pair(x,y));
	}
	sort(A.begin(),A.end(),[](pair<int,int>l,pair<int,int>r){
		return (long)l.first*r.second-(long)l.second*r.first>0;
	});
	int sy=0;
	for(pair<int,int>p:A)sy+=p.second;
	vector<pair<int,int> >ans;
	ans.push_back(make_pair(0,-sy));
	for(pair<int,int>p:A)ans.push_back(make_pair(ans.back().first+p.first,ans.back().second+p.second));
	{
		int n=ans.size();
		for(int i=n-2;i>=0;i--)ans.push_back(make_pair(ans[i].first,-ans[i].second));
	}
	{
		int n=ans.size();
		for(int i=n-2;i>0;i--)ans.push_back(make_pair(-ans[i].first,ans[i].second));
	}
	cout<<ans.size()<<"\n";
	for(pair<int,int>p:ans)cout<<p.first<<" "<<p.second<<"\n";
}