#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

void prep() {
	string s; cin >> s;
	vector<int> vis(50, -1), arr;
	int lo = 0;
	for (int i = 0; i < 50 && sz(arr) < 8; i++) {
		while (vis[lo] != -1)
			lo++;
		int x = s[lo] - 'A';
		int j = lo + 1;
		while (s[lo] != s[j])
			j++;
		vis[lo] = vis[j] = 1;
		arr.push_back(j);
	}
	string t(50, '0');
	for (int i = 0; i < 48; i += 6) {
		int v = arr[i / 6];
		for (int j = i; j < i + 6; j++)
			t[j] += v % 2, v /= 2;
		reverse(t.begin() + i, t.begin() + i + 6);
	}
	cout << t << endl;
}

//string uu = "OMTBGHTYVOUPWCKXVQEXSPLDNWYNAIBMKGISCHFRAJQLEFRUJD";

int get(int p) {
//	return uu[p] - 'A';
	cout << p + 1 << endl;
	string s; cin >> s;
	return s[0] - 'A';
}

void play() {
	string s; cin >> s;
	vector<int> arr;
	for (int i = 0; i < 48; i += 6) {
		int v = 0;
		for (int j = i; j < i + 6; j++)
			v = 2 * v + (s[j] - '0');
		arr.push_back(v);
	}
	vector<int> vis(50, -1);
	int lo = 0;
	for (int i: arr) {
		while (vis[lo] != -1)
			lo++;
		int x = get(lo);
		int y = get(i);
		assert(x == y);
		vis[lo] = x;
		vis[i] = y;
	}
	set<int> todo;
	for (int i = 0; i < 50; i++)
		if (vis[i] == -1)
			todo.insert(i);
	vector<int> know(26, -1);
//	int miss = 0;
	while (!todo.empty()) {
		int i = *todo.begin();
		todo.erase(todo.begin());
		int x = get(i);
		if (know[x] != -1) {
			assert(x == get(know[x]));
			continue;
		}
		know[x] = i;
		int j = *todo.begin();
		todo.erase(todo.begin());
		int y = get(j);
		if (x == y)
			continue;
		if (know[y] != -1) {
			assert(get(j) == get(know[y]));
			continue;
		}
		know[y] = j;
//		miss++;
	}
//	cerr << miss << endl;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	string s; cin >> s;
	int t; cin >> t;
	if (s == "prepare")
		while (t--) prep();
	else
		while (t--) play();
}