#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, DUT, Da Nang */

const ll INF = 1e9;
const int N = 1e5 + 10;

int cnt[N], RR[N];
bool ok[N];
int onLeft[N], onRight[N];
bool asked[N];

void BaoJiaoPisu() {
	string s; cin >> s;
	if(s == "prepare") {
		int t; cin >> t;
		while(t--) {
			for(int i = 0; i <= 26; i++) cnt[i] = 0;
			string s; cin >> s;
			for(int i = 0; i < s.size(); i++) {
				int x = (s[i] - 'A');
				cout << cnt[x];
				cnt[x]++;
			}
			cout << endl;
		}
	} else {
		int t; cin >> t;
		while(t--) {
			vector<int> left, right;
			for(int i = 1; i <= 50; i++) {
				ok[i] = asked[i] = 0;
				char c; cin >> c;
				if(c == '0') left.pb(i);
				else right.pb(i);
			}
			// string T; cin >> T;
			for(int i = 0; i <= 25; i++) {
				onLeft[i] = onRight[i] = ok[i] = 0;
			}

			shuffle(all(left), rng);
			shuffle(all(right), rng);
			int cnt = 0;
			int wrong = 0;
			for(int i = 0; i < 25; i += 2) {
				cout << left[i] << endl;
				string s; cin >> s;
				// string s = ""; s += T[left[i] - 1];
				int curr = s[0] - 'A';
				onLeft[curr] = left[i];
				cout << left[(i + 1) % 25] << endl;
				cin >> s;
				// s = ""; s += T[left[(i + 1) % 25] - 1];
				curr = s[0] - 'A';
				onLeft[curr] = left[(i + 1) % 25];
				++wrong;
			}

			for(int i = 0; i < 25; i++) {
				if(!asked[i]) {
					cout << right[i] << endl;
					string s; cin >> s;
					// string s = ""; s += T[right[i] - 1];
					RR[i] = s[0] - 'A';
				}
				int curr = RR[i];
				if(!ok[curr]) {
					assert(onLeft[curr]);
					cout << onLeft[curr] << endl;
					ok[curr] = true;
					string s; cin >> s;
					++cnt;
					// string s = ""; s += T[onLeft[curr] - 1];
				}
			}

			assert(cnt == 25);
		}
	}
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else 
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}