#include <bits/stdc++.h>
using namespace std;

int n;

struct query {
	vector <int> a;
	query () { a.resize(n + 1); }
	void set (int x, int y) {a[x] = y; /*cerr << "set " << x << " " << y << endl;*/}
	vector <int> ask() {
		cout << "test";
		for (int i = 1; i <= n; i++) {
			cout << " " << a[i];
		}
		cout << endl;
		string rep; cin >> rep;
		vector <int> ret(1);
		for (auto i : rep) ret.push_back(i == '1');
		return ret;
	}
};

void work () {
	cin >> n;	
	vector < vector <int> > a, b, left;
	for (int i = 1; i <= n; i++) {
		a.push_back({i});
	}
	while (a.size() > 1) {
		vector < vector <int> > newa;	
		vector <int> newb;
		query q;
		for (int i = 0; i < a.size(); i += 2) {
			if (i == a.size() - 1) {
				newb = a[i];
				continue;
			}
			q.set(a[i][0], a[i + 1][0]);
			q.set(a[i + 1][0], a[i][0]);
		}
		auto ret = q.ask();
		for (int i = 0; i < a.size(); i += 2) {
			if (i == a.size() - 1) {
				continue;
			}
			bool flag = true;
			if (ret[a[i][0]] != 1 || ret[a[i + 1][0]] != 1) {
				b.push_back(a[i]);
				b.push_back(a[i + 1]);
			}
			else {
				vector <int> tmp;
				for (int k = i; k <= i + 1; k++)
					for (auto j : a[k])
						tmp.push_back(j);
				newa.push_back(tmp);
			}
		}
		a = newa;
		if (newb.size()) left.push_back(newb);
	}
	if (a.size() == 0) {
		assert (left.size());
		a.push_back (left.back());
		left.pop_back();
	}
	for (auto i : left) b.push_back(i);
	sort(b.begin(), b.end(), [] (auto x, auto y) { return x.size() > y.size();});
	assert (a.size() == 1);
	vector <int> good = a[0];
	assert (good.size());
	int l = 0;
	while (l < b.size()) {
		int r = l;
		query q;
		while (r - l < good.size() && r < b.size()) {
			q.set(good[r - l], b[r].front());
			r++;
		}
		auto ret = q.ask();
		for (int i = l; i < r; i++) {
			if (ret[good[i - l]] == 1) {
				for (auto j : b[i]) {
					good.push_back(j);
				}
			}
		}
		l = r;
	}
	string out = "";
	for (int i = 1; i <= n; i++) out += '0';
	for (auto i : good) out[i - 1] = '1';
	cout << "answer " << out << endl;
}

int main() {
	int T;
	cin >> T;
	while (T--) work();
}