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

#define MAX 1000000000LL

bitset<MAX> seen;

#define WANTED 10001
long long a[WANTED];
long long u = 1;

long long other(long long n, long long p) {
	for (long long m=p; m<MAX; m+=p) {
		if (!seen[m]) {
			seen[m] = true;

			if (m<WANTED) {
				a[m] = n;

				while (u < WANTED && a[u]) {
					cout << u << ' ' << a[u] << endl;
					u++;
				}
			}

			return m/p;
		}
	}
	return -1;
}

int main() {
	long long v = 1;
	for (long long n=1; u<WANTED; n++) {
		v = other(n, v);
		if (v<0) {
			break;
		}
	}

	return 0;
}