#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <random>
#include <chrono>
#include <map>
using namespace std;

vector<string> a;

int hamming(const string &a, const string &b) {
	int nr = 0;
	for (int i = 0; i < a.size(); ++i)
		if (a[i] == b[i])
			++nr;
	return nr;
}

map<pair<vector<string>, int>, pair<string, int>> f;
int get_depth(const vector<string> &pos, int depth = 6) {
	//cout << depth << endl;
	if (depth < 0)
		return 1;

	if (pos.size() == 0)
		return 0;

	if (pos.size() == 1) {
		f[{pos, depth}] = {pos[0], 1};
		return 1;
	}

	if (pos.size() == 2) {
		f[{pos, depth}] = {pos[0], 2};
		return 2;
	}

	if (f.count({pos, depth}))
		return f[{pos, depth}].second;

	int best = depth + 1;
	string wh;
	for (auto it : pos) {
		vector<string> cnt[9];
		for (auto it2 : pos)
			cnt[hamming(it, it2)].push_back(it2);

		int mx = 0;
		for (int i = 0; i <= 8 && mx < best; ++i)
			mx = max(mx, 1 + get_depth(cnt[i], depth - 1));

		if (mx < best) {
			best = mx;
			wh = it;
		}
		if (best <= depth)
			break;
	}

	for (int j = 0; j <= depth; ++j)
		f[{pos, j}] = {wh, best};
	return best;
}

void solve() {
	vector<string> pos = a;
	int nr = 6, depth = 6;
	bool first = true;
	while (!pos.empty() && nr--) {
		(void)get_depth(pos, depth);
		string wh = f[{pos, depth}].first; 
		depth -= 1;

		vector<string> bst[9];
		for (auto it : pos)
			bst[hamming(it, wh)].push_back(it);

		//for (int i = 0; i <= 8; ++i)
		//	cout << bst[i].size() << " ";
		//cout << endl;
		int x;
		cout << wh << endl;
		cin >> x;
		if (x == 8)
			break;
		pos = bst[x];
	}
	if (nr == -1)
		exit(0);
}

int main() {
	string s = "RQKBBNRN";
	sort(s.begin(), s.end());
	do {
		int sum = 0, nr = 0, bad = false;
		for (int i = 0; i < s.size(); ++i) {
			if (s[i] == 'B')
				sum += i & 1;
			else if (s[i] == 'R')
				nr += 1;
			else if (s[i] == 'K' && nr != 1) {
				bad = true;
				break;
			}
		}

		if (sum != 1 || bad)
			continue;

		a.push_back(s);
	} while(next_permutation(s.begin(), s.end()));

	while (1) {
		cin >> s;
		if (s == "END")
			break;

		int x;
		cin >> x;
		solve();
	}
	return 0;
}