#include<bits/stdc++.h>
using std::cin;
using std::cout;
std::string s = "RQKBBNRN";
const int N = 960;
std::vector<std::string> ans;
int v[960][960];
int who(std::vector<int> o) {
	if(o.size() == 1) return o[0];
	int best = 0, max = 1e9;
	for(int i = 0;i < N;++i) {
		int res[9] = {};
		for(int x : o) ++ res[v[i][x]];
		int mx = *std::max_element(res, res + 9);
		if(mx < max) max = mx, best = i;
	}
	return best;
}
int dfs(std::vector<int> o) {
	if(o.size() == 0) return 0;
	if(o.size() == 1) return 1;
	int best = who(o);
	std::vector<int> res[9];
	for(int x : o) res[v[best][x]].push_back(x);
	int ans = 0;
	for(auto & x : res) ans = std::max(ans, dfs(x) + 1);
	return ans;
}
int main() {
	std::sort(s.begin(), s.end());
	do {
		int x = 0;
		for(int i = 0;i < 8;++i) if(s[i] == 'B') x ^= i;
		if(x % 2 == 0) continue;
		int p = find(s.begin(), s.end(), 'K') - s.begin();
		int l = 0;
		for(int i = 0;i < p;++i) l += s[i] == 'R';
		if(l != 1) continue;
		ans.push_back(s);
	} while(next_permutation(s.begin(), s.end()));
//	cout << ans.size() << '\n';
	for(int i = 0;i < N;++i)
		for(int j = 0;j < N;++j)
			for(int k = 0;k < 8;++k) {
				v[i][j] += ans[i][k] == ans[j][k];
			}
	for(;;) {
		std::string s;
		std::vector<int> v(N);
		for(int i = 0;i < N;++i) v[i] = i;
	//cout << dfs(v) << '\n';
		cin >> s;
		if(s == "END") break;
		cin >> s;
		for(;;) {
			int z = who(v);
			cout << ans[z] << std::endl;
			int x; cin >> x;
			if(x == 8) break;
			v.erase(remove_if(v.begin(), v.end(), [&](int id) { return ::v[id][z] != x; }), v.end());
		}

	}
}