#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;

#define MAX 10001

int a[MAX];
int visited[MAX];

int main() {
	memset(visited, -1, sizeof(visited));

	for (int n=1; n<MAX; n++) {
		for (int k=1; n-k*k>0; k++) {
			int x = k/a[n-k*k];
			if (x<MAX) {
				visited[x]=n;
			}
		}

		int v=1;
		while (visited[v]==n) {
			v++;
		}

		printf("%d %d\n", n, a[n]=v);
		fflush(stdout);
	}

	return 0;
}