#include <bits/stdc++.h>
using namespace std;
vector<int> get(int n) {
	vector<int> ans = {0};
	for (int i = 1; i < n; i++) {
		ans.push_back(i);
		vector<int> res = ans;
		res.pop_back();
		reverse(res.begin(), res.end());
		for (int x : res) ans.push_back(x);
	}
	ans.push_back(n - 1);
	return ans;
}
int query(int x, int len) {
	cout << x + 1 << " " << x + len + 1 << endl;
	int val;
	cin >> val;
	return val;
}
int main() {
	int n;
	cin >> n;
	int val;
	cin >> val;
	for (int i = 0; i < n; i++) {
		int maxx = 0, maxS = 0;
		int S = 0;
		vector<int> v = get(n - i);
		for (int x : v) {
			int val = query(i, x);
			S ^= (1 << x);
			if (val == n) {
				return 0;
			}
			if (val > maxx) {
				maxx = val;
				maxS = S;
			}
		}
		while (maxS) {
			int x = query(i, __builtin_ctz(maxS));
			if (x == n) return 0;
			maxS ^= (1 << __builtin_ctz(maxS));
		}
	}
}