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

vector<int> gray(int n) {
	vector<int> gray = {0};
	for (int i = 1; i < n; i++) {
		gray.push_back(i);
		for (int j = gray.size()-2; j >= 0; j--) gray.push_back(gray[j]);
	}
	gray.push_back(n-1);
	return gray;
}
int main() {
	int n; cin >> n;

	for (int i = 0; i < n; i++) {
		int best = 0, bestMask = 0;
		int mask = 0;
		auto g = gray(n-i);
		for (int j = 0; j < (1<<(n-i)); j++) { 
			cout << i+1 << ' ' << i+1+g[j] << endl;
			mask ^= (1<<g[j]);
			int val; cin >> val;
			if (val == n) return 0;
			if (val > best) {
				best = val;
				bestMask = mask;
			}
		}
		assert(mask == 0);
		int val;
		while (bestMask) {
			cout << i+1 << ' ' << i+__builtin_ctz(bestMask)+1 << endl;
			bestMask -= bestMask&-bestMask;
			int val; cin >> val;
		}
	}
}