#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using vi = vector<int>;
using i64 = long long;

auto Q(string s) {
  printf("QUERY %s\n", s.c_str());
  fflush(stdout);
  vi vt(s.size());
  for (int i = 0; i < vt.size(); ++i) scanf("%d", &vt[i]);
  return vt;
}

int main() {
  int n;
  scanf("%d", &n);
  string s(n, '1');
  auto deg = Q(s);
  vector<i64> sum(n, 0);
  for (int i = 0; i < 15; ++i) {
    s = string(n, '0');
    for (int j = 0; j < n; ++j) {
      if ((j+1) & (1<<i)) {
        s[j] = '1';
      }
    }
    auto f = Q(s);
    for (int j = 0; j < n; ++j) sum[j] += f[j] * (1<<i);
  }
  queue<int> q;
  for (int i = 0; i < n; ++i) if (deg[i] == 1) {
    q.push(i);
  }
  set<pii> E;
  while (not q.empty()) {
    auto u = q.front(); q.pop();
    int v = sum[u] - 1;
    E.emplace(min(u, v), max(u, v));
    if (deg[v] > 1) {
      sum[v] -= (u+1);
      deg[v]--;
      if (deg[v] == 1) {
        q.push(v);
      }
    }
  }
  assert(E.size() == n-1);
  puts("ANSWER");
  for (auto [u,v]: E) printf("%d %d\n", u+1, v+1);
  fflush(stdout);
  return 0;
}