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

#define MAX (1LL<<36)	// 8Gb
bitset<MAX> *seen = 0;

// first primes (with a zero at the end!)
long long primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 0 };
// multiples of first primes
long long mult  [] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 0 };

int main() {
	seen = new bitset<MAX>;
	if (!seen) {
		cerr << "# not enoug memory" << endl;
		return 1;
	}

	cout << 1 << ' ' << 2 << endl;

	long long pp, p;
	for (long long n=1;; n++) {
		long long v;
		if (n <= 2) {
			v = n;
		} else {
			for (int i=0;; i++) {
				if (!primes[i]) {
					goto end;
				}
				if (pp % primes[i] && p % primes[i]) {
					while (seen->test(mult[i])) {
						mult[i] += primes[i];
						if (mult[i] >= MAX) {
							goto end;
						}
					}

					v = mult[i];

					if (v==primes[i]) {
						cout << (i+1) << ' ' << n << endl;
					}

					break;
				}
			}
		}

		seen->set(v);

		pp = p;
		p = v;
	}

end:
	delete seen;
	seen = 0;

	return 0;
}