// 

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const long double PI = acos(-1);
const int INF = (int)(1e9);

int main() {
	int n = (int)(1e6);
	vector<pair<int, int>> xy;
	int r = INF, x = INF, dy = INF, py = 0;
	xy.emplace_back(INF, 0);
	while ((int)(xy.size()) <= n/4) {
		--x;
		long double cs = (double)(x) / r, sn = sqrt(1-cs*cs), y = r * sn;
		if ((int)(round(y))-py != dy) xy.emplace_back(x, (int)(round(y)));
		dy = (int)(round(y)) - py;
		py = (int)(round(y));
	}
	vector<pair<int, int>> res, tmp;
	res.insert(res.end(), xy.begin(), xy.begin()+n/4);
	res.insert(res.end(), xy.rbegin(), xy.rbegin()+n/4);
	rep3(i, n/4, n/2) res[i].first *= -1;
	tmp = res;
	rep(i, n/2) {
		tmp[i].first *= -1;
		tmp[i].second *= -1;
	}
	res.insert(res.end(), all(tmp));
	cout << n << endl;
	rep(i, n) cout << res[i].first << ' ' << res[i].second << endl;
	cout.flush();
	return 0;
}