#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 303030
#define MAXS 70
#define INF 1'000'000'100'000'000'000
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1'000'000'007
#define TC 1
int deg[MAX];
const int X = 15;
int qres[X][MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i, j;
	cout << "QUERY ";
	for (i = 0; i < N; i++) cout << "1";
	cout << endl;
	for (i = 0; i < N; i++) cin >> deg[i];
	for (i = 0; i < X; i++) {
		cout << "QUERY ";
		for (j = 0; j < N; j++) cout << (j >> i & 1);
		cout << endl;
		for (j = 0; j < N; j++) cin >> qres[i][j];
	}
	vector<pii> edges;
	queue<int> q;
	for (i = 0; i < N; i++) if (deg[i] == 1) q.push(i);
	while (q.size()) {
		if (edges.size() == N - 1) break;
		int t = q.front();
		q.pop();
		int p = 0;
		for (i = 0; i < X; i++) p |= (qres[i][t] << i);
		edges.emplace_back(p, t);
		deg[p]--;
		if (deg[p] == 1) q.push(p);
		for (i = 0; i < X; i++) if (t >> i & 1) qres[i][p]--;
	}
	cout << "ANSWER" << endl;
	for (auto& [a, b] : edges) cout << a + 1 << bb << b + 1 << endl;
}