using namespace std;
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define maxn 105
#define mod 998244353
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll ksm(ll a, ll b) {if (b == 0) return 1; ll ns = ksm(a, b >> 1); ns = ns * ns % mod; if (b & 1) ns = ns * a % mod; return ns;}
using namespace std;
int tst = 0;
int tval[maxn][maxn];
int tans[maxn];

int ask[maxn][maxn];
int fa[maxn];

int n;
int sz[maxn];
int gfa(int x) {
    if (fa[x] == x) return x;
    return fa[x] = gfa(fa[x]);
}
void init() {
    for (int i = 1; i <= n; i++)
        tans[i] = (i * 2 < n) ? 0 : 1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            if (tans[i]) tval[i][j] = tans[j];
            else tval[i][j] = 1; 
        }
    memset(ask, 0, sizeof(ask));
    for (int i = 0; i < maxn; i++)
        fa[i] = i, sz[i] = 1;
    for (int i = 0; i < maxn; i++)
        ask[i][i] = 1;
}
void uni(int a, int b) {
    if (a == b) return ;
    sz[b] += sz[a];
    for (int i = 0; i < maxn; i++)
        ask[i][b] |= ask[i][a], 
        ask[b][i] |= ask[a][i];
    fa[a] = b;
}
int rnd[maxn];
int mat[maxn];
char res[maxn];
void query() {
    if (!tst) {
        cout << "test ";
        for (int i = 1; i <= n; i++) cout << mat[i] << ' ';
        cout << endl; fflush(stdout);
        scanf("%s", res + 1);
    }
    else {
        for (int i = 1; i <= n; i++) {
            res[i] = '0';
            if (mat[i]) res[i] = tval[i][mat[i]] + '0';
        }
    }
    for (int i = 1; i <= n; i++) 
        if (mat[i] && res[i] == '1' && res[mat[i]] == '1' && i < mat[i]) 
            uni(gfa(i), gfa(mat[i]));
}
int main() {

    mt19937 rd(1234);
    int test;
    cin >> test;
    while (test--) {
        cin >> n;
        init();
        for (int ak = 0; ak < 12; ak++) {
            if (tst) {
                for (int i = 1; i <= n; i++)
                    if (fa[i] == i) cout << i << ' ' << sz[i] << endl;
            }
            for (int i = 1; i <= n; i++)
                rnd[i] = rd();
            vi bel, up;
            for (int i = 1; i <= n; i++)
                bel.pb(i), up.pb(i);
            auto eva = [&](int a)
            {
                if (gfa(a) != a)
                    return mp(sz[gfa(a)], rnd[a]);
                else 
                    return mp(1, -sz[gfa(a)]);
                
            };
            sort(bel.begin(), bel.end(), [&](int a, int b)
                   { return eva(a) < eva(b); });

            for (int i = 1; i <= n; i++)
                rnd[i] = rd();

            sort(up.begin(), up.end(), [&](int a, int b)
                { return mp(sz[gfa(a)], rnd[a]) < mp(sz[gfa(b)], rnd[b]); });
            reverse(up.begin(), up.end());
            memset(mat, 0, sizeof(mat));
            for (auto id : bel) {
                if (mat[id]) continue;
                for (auto v : up) {
                    if (mat[v]) continue;
                    if (v == id) continue;
                    if (ask[gfa(id)][gfa(v)]) continue;
                    ask[gfa(id)][gfa(v)] = 1;
                    ask[gfa(v)][gfa(id)] = 1;
                    mat[id] = v;
                    mat[v] = id;
                    break;
                }
            }
            query();
        }
        if (!tst) {
            cout << "answer ";
            for (int i = 1; i <= n; i++) 
                if (sz[gfa(i)] * 2 > n) cout << '1';
                else cout << '0';
            cout << endl;
            fflush(stdout);
        }
        else {
            for (int i = 1; i <= n; i++) {
                int nans = sz[gfa(i)] * 2 > n;
                cout << i << ' ' << nans << ' ' << ' ' << gfa(i) << ' ' << sz[gfa(i)] << ' ' << tans[i] << endl;
                assert(nans == tans[i]);
            }
            cout << "CORRECT " << endl;
        }
    }
    return 0;
}
/*
sort by (size, random)
*/