#include<bits/stdc++.h>
using namespace std;
struct Point {
	int x, y;
	Point(int x = 0, int y = 0) : x(x), y(y) {}
	Point operator + (const Point &rhs) const {
		return Point(x + rhs.x, y + rhs.y);
	}
	Point operator - (const Point &rhs) const {
		return Point(x - rhs.x, y - rhs.y);
	}
}p[1005];
int n = 1000;
vector<pair<Point, Point> > ans;
long long Cross(Point a, Point b) {
	return 1ll * a.x * b.y - 1ll * b.y * a.x;
}
int Check(int l, int r) {
	for(int i = 0; i < n; ++ i) {
		if(Cross(p[i] - p[l], p[r] - p[l]) > 0)
			return 0;
	}
	return 1;
}
int main() {
	p[0] = Point(0, 0);
	for(int i = 1; i < n / 2; ++ i) {
		p[i] = p[i - 1] + Point(i, i * i);
	}
	for(int i = n / 2; i < n; ++ i) {
		if(i & 1)
			p[i] = p[i - 1] + Point(n / 2, n / 2 * n / 2);
		else
			p[i] = p[i - 1] + Point(1, 0);
	}
	printf("%d\n", n);
	for(int i = 0; i < n; ++ i)
		printf("%d %d\n", p[i].x, p[i].y);
	for(int j = n / 2 - 2; j >= 0; -- j) {
		if(!p[j + 2].y)
			continue;
		ans.push_back({p[j], p[j + 2]});
		// assert(Check(j, j + 2));
		p[j + 1] = p[j + 2] + p[j] - p[j + 1];
	}
	for(int i = n / 2 + 2, k = n / 2; i < n; i += 2, ++ k) {
		ans.push_back({p[k], p[i]});
		// assert(Check(k, i));
		for(int j = i - 1; j > k; -- j)
			p[j] = p[i] + p[k] - p[j];
		reverse(p + k + 1, p + i);
		// for(int l = k + 1, r = i - 1; l < r; ++ l, -- r)
		// 	swap(p[l], p[r]);
		for(int j = k - 1; j >= 0; -- j) {
			if(!p[j + 2].y)
				continue;
			ans.push_back({p[j], p[j + 2]});
			// assert(Check(j, j + 2));
			p[j + 1] = p[j + 2] + p[j] - p[j + 1];
		}
	}
	printf("%d\n", (int)ans.size());
	for(auto p : ans)
		printf("%d %d %d %d\n", p.first.x, p.first.y, p.second.x, p.second.y);
}