#include <bits/stdc++.h>
//
#include "tree.h"
//
#define N 1005
#define LogN 13
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define vec vector
#define vi vector<int>
using namespace std;
vi depv[N]; int dis[N], anc[N][LogN], dep[N];
int ask(int u, vi v);
void answer(int u, int v);
// TODO: your functions
int lca(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = LogN - 1; i >= 0; i--) if (dep[anc[x][i]] >= dep[y]) x = anc[x][i];
  if (x == y) return x;
  for (int i = LogN - 1; i >= 0; i--) if (anc[x][i] != anc[y][i]) x = anc[x][i], y = anc[y][i];
  return anc[x][0];
}
ll gdist(int x, int y) { return dep[x] + dep[y] - 2 * dep[lca(x, y)]; }
ll alldist(int x, vi A) {
  ll r = 0; for (auto y : A) r += gdist(x, y); return r;
}
void solve(vi A, vi B) {
  if (B.empty()) return ;
  if (A.size() == 1) {
    for (auto x : B) { answer(x, A[0]); anc[x][0] = A[0], dep[x] = dep[A[0]] +1; 
      for (int i = 1; i < LogN; i++) anc[x][i] = anc[anc[x][i - 1]][i - 1];
    } 
    return ;
  }
  random_shuffle(A.begin(), A.end());
  int l1 = A.size(), l2 = B.size(), rhs = (l1 + 1) / 2; vi rl; int rsz = rhs;
  for (int i = 0; i < rhs; i++) rl.push_back(A[i]);
  static map<int, vi> L, VP;
  for (int i = 0; i < l1; i++) L[alldist(A[i], rl)].push_back(A[i]);
  for (int i = 0; i < l2; i++) VP[ask(B[i], rl) - rsz].push_back(B[i]);
  for (auto it : L) {
    if (VP[it.fi].size()) solve(it.se, VP[it.fi]);
  }
}
void solver(int n, int A, int B) {
	// TODO: your solver
  srand(time(NULL));
  if (n == 1) return ;
  int rt = rand() % n + 1, maxd = 0;
  for (int i = 1; i <= n; i++) { dis[i] = ask(i, vi{rt}); depv[dis[i]].push_back(i), maxd = max(maxd, dis[i]); }
  for (int i = 0; i < maxd; i++) solve(depv[i], depv[i + 1]);
}

// #define YHD
#ifdef YHD
int ask(int u, vi v) {
  printf("%d %d\n", u, v[0]);
  int d; cin >> d; return d;
}
void answer(int u, int v) {
  return ;
}
int main() {
  solver(4, 1000000, 1000000);
  return 0;
}
#endif