#include <iostream>
#include <unordered_map>

using namespace std;

unordered_map<long long, long long> pos;

int main() {
	long long m = 0;
	long long v = 0;
	for (long long n=1; m<10000; n++) {
		if (n==1) {
			v = 1;
		} else if (n==2) {
			v = 0;
		}

		if (v==1) {
			cout << ++m << ' ' << n << endl;
		}

		int w = v;
		if (pos.count(v)) {
			v = (n-pos[v])*v;
		} else {
			v = 1;
		}

		pos[w] = n;
	}

	return 0;
}