#include <bits/stdc++.h>
using namespace std;
int n, pos[105], tmp[105];
void solve(int l, int r) {
	if (l == r) return void (pos[l] = l);
	int mid = l + r >> 1;
	solve(l, mid), solve(mid+1, r);
	int p = l, q = mid + 1, t = 0;
	while (p <= mid && q <= r) {
		printf ("%d %d\n", pos[p], pos[q]), fflush (stdout);
		int v; scanf ("%d", &v);
		if (~ v) { if (v) swap(pos[p], pos[q]); } else exit (0);
		tmp[++t] = pos[p] < pos[q] ? pos[p++] : pos[q++];
	}
	while (p <= mid) tmp[++t] = pos[p++];
	while (q <= r) tmp[++t] = pos[q++];
	for (int i=l; i<=r; i++) pos[i] = tmp[i-l+1];
}
int main() {
	cin >> n;
	solve(1, n);
	for (int i=1; i<n; i++)
		if (pos[i] ^ i) {
			int j;
			for (j=i+1; pos[j]^i; j++) ;
			printf ("%d %d\n", pos[i], i), fflush (stdout);
			int v; scanf ("%d", &v);
			if (~ v) assert (v), swap(pos[i], pos[j]); else exit (0);
		}
}