#include <iostream>
#include <bitset>
#include <unordered_set>
using namespace std;

#define MAX 	(1LL<<14)
#define ORIGIN	(MAX/2)

long long pack(long long x, long long y) {
	return x + MAX * y;
}
void unpack(long long index, long long &x, long long &y) {
	x = index % MAX; index /= MAX;
	y = index % MAX;
}

#define DXY	8
long long dxy[DXY];

void initdxy() {
	int d=0;

	for (long long dx=-1; dx<=+1; dx++) {
		for (long long dy=-1; dy<=+1; dy++) {
			if (dx || dy) {
				dxy[d] = pack(dx,dy);
				d++;
			}
		}
	}
}

bitset<MAX*MAX> world;

int countUpTo3(long long index) {
	int nb = 0;

	for (int d=0; d<DXY; d++) {
		if (world.test(index+dxy[d])) {
			nb++;
			if (nb==3) {
				break;
			}
		}
	}

	return nb;
}

typedef unordered_set<long long> set;

int main() {
	initdxy();

	set gen[2];

	int g = 0;
	gen[g].insert(pack(ORIGIN, ORIGIN));

	for (int n=1; ; n++) {
		if (n>1) {
			cout << n << ' ' << gen[g].size()/4 << endl;
		}

		if (n==ORIGIN-1) {
			break;
		}

		for (set::const_iterator it = gen[g].begin(); it != gen[g].end(); ++it) {
			world.set(*it);
		}

		gen[1-g].clear();
		for (set::const_iterator it = gen[g].begin(); it != gen[g].end(); ++it) {
			for (int d=0; d<DXY; d++) {
				long long o = *it + dxy[d];
				if (!world.test(o)) {
					int c = countUpTo3(o);
					if (c==1 || c==2) {
						gen[1-g].insert(o);
					}
				}
			}
		}

		g=1-g;
	}

	return 0;
}