#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef long double ld;
const ld PI = acosl(-1);
const ll mod7 = 1e9 + 7;
const ll mod9 = 998244353;
const ll INF = 2 * 1024 * 1024 * 1023;
const char nl = '\n';
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define all(v) v.begin(),v.end()
#pragma GCC optimize("O2")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;
 
ll l, r, k, n, m, p, q, u, v, w, x, y, z;
string s, t;
 
vi d4x = {1, 0, -1, 0};
vi d4y = {0, 1, 0, -1};
vi d8x = {1, 0, -1, 0, 1, 1, -1, -1};
vi d8y = {0, 1, 0, -1, 1, -1, 1, -1};
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  string type;
bool multiTest = 1;
void solve(int tt) {

  string z;


  if(type == "prepare") {
    cin >> s;
    int ptr = 0;
    vi found(50, 0);
    string ans;
    forn(i, 8) {
      while(found[ptr]) ptr++;
      int pos;
      for(int j = ptr+1; j < 50; j++) {
        if(s[ptr] == s[j]) pos = j;
      }
      for(int i = 5; i > -1; i--) {
        if(pos & (1 << i)) ans += '1';
        else ans += '0';
      }
      found[ptr] = 1;
      found[pos] = 1;
    }
    ans += "00";
    cout << ans << nl;
    return;
  }
  
  cin >> s;

  int ptr = 0;
  vi visited(50, 0);
  forn(i, 8) {
    while(visited[ptr]) ptr++;
    int pos = 0;

    for(int j = 5; j >= 0; j--) {
      if(s[6*i + 5 - j] == '1') pos += (1 << j);
    }
    cout << ptr + 1 << endl;
    cin >> z;
    if(z == "##") exit(0);
    cout << pos + 1 << endl;
    cin >> z;
    if(z == "##") exit(0);
    visited[ptr] = 1;
    visited[pos] = 1;
  }

  vi positions;
  forn(i, 50) if(!visited[i]) positions.push_back(i+1);

  vi found(26, -1);
  forn(i, positions.size()) {
    cout << positions[i] << endl;
    cin >> z;
    if(z == "##") exit(0);
    if(found[z[0]-'A'] == -1) {
      found[z[0]-'A'] = positions[i];
      i++;
      cout << positions[i] << endl;
      cin >> z;
      if(z == "##") exit(0);
      if(z[1] == '+' || z[1] == '!') continue;
      if(found[z[0]-'A'] != -1) {
        cout << positions[i] << endl;
        cin >> z;
        if(z == "##") exit(0);
        cout << found[z[0]-'A'] << endl;
        cin >> z;
        if(z == "##") exit(0);
      }
      else found[z[0]-'A'] = positions[i];
    }
    else {
      int otherPos = found[z[0]-'A'];
      cout << otherPos << endl;
      cin >> z;
      if(z == "##") exit(0);
    }
  }

}
 
int main() {
 
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cout << fixed << setprecision(14);
   cin >> type;

    int t = 1;
    if (multiTest) cin >> t;
    for (int ii = 0; ii < t; ii++) {
        solve(ii);
    }
}