#include <iostream>
#include <iomanip>
#include <climits>
#include <stack>
#include <fstream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define FOR(i,n) for(int i=0,_n=n;i<_n;i++)
#define FORR(i,s,n) for(int i=s,_n=n;i<_n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>
#define fs first
#define sec second

#define maxn 100010

using namespace std;
typedef long long ll;

const ll MOD = 1000000007LL;

int answers[18][maxn];
int degree[maxn];

int main(){
    int n;
    scanf("%d", &n);
    printf("QUERY ");
    FOR(i,n)printf("1");
    printf("\n");fflush(stdout);
    FOR(i,n)scanf("%d",degree+i);
    for(int b=0;(1<<b)<=n;b++){
        printf("QUERY ");
        FOR(i,n)printf("%d",i&(1<<b)?1:0);
        printf("\n");fflush(stdout);
        FOR(i,n)scanf("%d",&answers[b][i]);
    }
    vector<pii> ans;
    queue<int> q;
    FOR(i,n)if(degree[i]==1)q.push(i);
    while(!q.empty()){
        int node = q.front();
        q.pop();
        if(degree[node] == 0)break;
        int parent = 0;
        for(int b=0;(1<<b)<=n;b++){
            if(answers[b][node])parent+=1<<b;
        }
        ans.pb(mp(node,parent));
        for(int b=0;(1<<b)<=n;b++)
            if(node&(1<<b))answers[b][parent]-=1;
        degree[parent]--;
        if(degree[parent]==1)q.push(parent);
    }
    printf("ANSWER\n");
    FOR(i,n-1)printf("%d %d\n", ans[i].fs + 1, ans[i].sec + 1);
    fflush(stdout);
	return 0;
}