#include <stdio.h>
#include <string.h>

#define MAX 25

bool visited[4*MAX];

long long nb = 0;

void explore(int n4, int p, int rem) {
	if (rem==0) {
		nb++;
	} else {
		while (visited[p]) {
			p++;
		}

		// we force the first first differences to be > 1
		// the exploration will avoid a(n-1) cases
		for (int d=p==0 ? 2 : 1; p+3*d<n4; d++) {
			if (!visited[p+d] && !visited[p+2*d] && !visited[p+3*d]) {
				visited[p] = true;
				visited[p+d] = true;
				visited[p+2*d] = true;
				visited[p+3*d] = true;

				explore(n4, p, rem-1);

				visited[p+3*d] = false;
				visited[p+2*d] = false;
				visited[p+d] = false;
				visited[p] = false;
			}
		}
	}
}

long long a(int n) {
	nb = 0;

	explore(4*n, 0, n);

	return nb;
}

int main() {
	long long p = 0;
	for (int n=0; n<MAX; n++) {
		p += a(n);
		printf("%d %lld\n", n, p);
		fflush(stdout);
	}

	return 0;
}