// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 15:14:12
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

mt19937 rng(2137);

signed main() {

	int n = 10;
	cin >> n;
	
	/*
	vector xd(n + 1, vector<int>(n + 1));

	FOR(i, 1, n) FOR(j, i, n)
		xd[i][j] = rng() % 2;

	auto Cnt = [&]() {
		vector<int> cnt(n + 2);
		FOR(i, 1, n) FOR(j, i, n)
			if (xd[i][j]) {
				cnt[i]++;
				cnt[j + 1]--;
			}

		int res = 0;
		FOR(i, 1, n) {
			cnt[i] += cnt[i - 1];
			if (cnt[i] == 0)
				res++;
		}
		return res;
	};
	*/

	int k;// = Cnt();
	cin >> k;

	auto flip = [&](int i, int j) {
		cout << i << ' ' << j << endl;
		
		//xd[i][j] ^= 1;
		//k = Cnt();
		cin >> k;

		if (k == n) {
			debug("SUCCESS");
			exit(0);
		}
	};

	FOR(i, 1, n - 1) {
		vector<pair<int, int>> segs;

		FOR(j, i, n)
			segs.emplace_back(i, j);

		int prev = 0;
		int goal = -1;
		bool done = false;

		REP(j, 1 << sz(segs)) {
			int mask = j ^ (j >> 1);
			
			if (prev != mask) {
				assert(__builtin_popcount(mask ^ prev) == 1);

				int id = __builtin_ctz(mask ^ prev);

				assert((mask & (1 << id)) ^ (prev & (1 << id)));

				flip(segs[id].st, segs[id].nd);
			}
			
			if (k > i) {
				flip(i + 1, n);
				done = true;
			}

			if (k == i) {
				if (goal == -1) {
					goal = mask;
				}
				else
				if (!done) {
					flip(i + 1, n);
					done = true;
				}

				if (k == i && done) {
					prev = mask;
					goal = mask;
					//debug("here", xd[i + 1][k], done);
					break;
				}
			}

			prev = mask;
		}


		REP(j, sz(segs)) {
			if (((prev >> j) & 1) != ((goal >> j) & 1)) {
				flip(segs[j].st, segs[j].nd);
			}
		}
		
		debug(i, goal, prev, done, k);

		assert(k >= i);
	}

	flip(n, n);

	assert(false);

	return 0;
}