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

#define MAX (1LL<<13)	// must be a power of 2

long long x[MAX];		// a(1) XOR ... XOR a(n)

#define VMAX (MAX<<4)	// must be a power of 2
						// so that if x, y < VMAX then x XOR y < VMAX
bool seen[VMAX];
long long unseen = 1;

int main() {
	memset(x, 0, sizeof(x));
	memset(seen, 0, sizeof(seen));

	for (long long n=1; n<MAX; n++) {
		for (long long v=unseen;; v++) {
			if (v==VMAX) {
				goto theEnd;
			}

			x[n] = x[n-1] ^ v;
			bool ok = true;	// so far

			for (long long w=1; n%w==0; w*=2) {
				if (seen[x[n-w] ^ x[n]]) {
					ok = false;
					break;
				}
			}

			if (ok) {
				for (long long w=1; n%w==0; w*=2) {
					seen[x[n-w] ^ x[n]] = true;
				}

				while (unseen < MAX && seen[unseen]) {
					unseen++;
				}

				printf("%lld %lld\n", n, v);
				fflush(stdout);
				break;
			}
		}
	}

theEnd:
	return 0;
}