#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}

signed main()
{
	int n=998;
	vector<pair<int,int>> v;
	cout<<n+2<<endl;
	for(int i=1;i<=n;i++)
	{
		if(i%2==0) v.eb(i,1);
		else v.eb(i,2);
	}
	printf("%d %d\n",1,0);
	printf("%d %d\n",n,0);
	for(int i=(int)v.size()-1;i>=0;i--) printf("%d %d\n",v[i].first,v[i].second);
	
	vector<vector<int>> ans;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j+1<(int)v.size();j++)
		{
			if(v[j].second<v[j+1].second&&v[j].second<v[j-1].second)
			{
				ans.pb({v[j+1].first,v[j+1].second,v[j-1].first,v[j-1].second});
				v[j].second+=2;
			}
		}
	}
	cout<<ans.size()<<endl;
	for(auto i:ans) print(i);
	return 0;
}