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

// a(1355) requires computing 325374625246 terms of Recaman's sequence!
#define WANTED 1355LL
#define MAX 2000000LL

long long a[WANTED];
bool seen[MAX];

int main() {
	memset(a, 255, sizeof(a));
	memset(seen, 0, sizeof(seen));

	long long v = 0;
	long long h = 0;
	long long u = 0;

	for (long long n=0; u<WANTED; n++) {
		if (n) {
			if (v>=n && !seen[v-n]) {
				v-=n;
				h--;
			} else {
				v+=n;
				h++;
			}
		}

		if (v<WANTED && a[v]<0) {
			a[v] = h;
			while (a[u]>=0) {
				printf("%lld %lld\n", u, a[u]);
				fflush(stdout);
				u++;
				if (u==WANTED) {
					break;
				}
			}
		}

		if (v>=MAX) {
			break;
		} else {
			seen[v] = true;
		}
	}

	return 0;
}