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

#define EVIL	16
bool evil[1<<EVIL];

bool isEvil(long long n) {
	bool is = true;

	while (n) {
		if (!evil[n & ((1 << EVIL)-1)]) {
			is = !is;
		}
		n >>= EVIL;
	}

	return is;
}

#define MAX 10001
long long a[MAX];
unordered_set<long long> seen;

int main() {
	evil[0] = true;
	for (int n=1; n<sizeof(evil)/sizeof(*evil); n++) {
		evil[n] = evil[n/2] != ((n%2)!=0);
	}

	long long t = 0;	// total of terms so far

	for (int n=1; n<MAX; n++) {
		for (a[n]=0;; a[n]++) {
			if (t+a[n]<0) {
				goto theEnd;	// exceeded capacity of long long
			} else if (!isEvil(t+a[n])) {
			} else if (!seen.count(a[n])) {
				bool ok = true;

				long long s = 0;
				for (long long k=n; k>0; k--) {
					s += a[k];
					if (!isEvil(s)) {
						ok = false;
						break;
					}
				}

				if (ok) {
					cout << n << ' ' << a[n] << endl;
					seen.insert(a[n]);
					t += a[n];
					break;
				}
			}
		}
	}

theEnd:

	return 0;
}