#include <bits/stdc++.h>
using namespace std;

vector<string> conf;

void init() {
	string s = "RQKBBNRN";
	sort(s.begin(), s.end());

	do {
		vector<int> kpos, rpos, bpos;
		for (int i = 0; i < 8; i++) {
			if (s[i] == 'K') kpos.push_back(i);
			else if (s[i] == 'R') rpos.push_back(i);
			else if (s[i] == 'B') bpos.push_back(i);
		}

		bool ok = 1;
		if (kpos[0] < rpos[0] || kpos[0] > rpos[1]) ok = 0;
		if (bpos[0] % 2 == bpos[1] % 2) ok = 0;
		if (ok) conf.push_back(s);

	} while (next_permutation(s.begin(), s.end()));
	assert(conf.size() == 960);
}

int dist(string s1, string s2) {
	int ans = 0;
	for (int i = 0; i < 8; i++) {
		if (s1[i] == s2[i]) ans++;
	}
	return ans;
}

void solve() {
	random_shuffle(conf.begin(), conf.end());

	vector<int> avail(960, 1);
	for (int _ = 0; _ < 5; _++) {
		if (accumulate(avail.begin(), avail.end(), 0) == 1) {
			break;
		}

		int cz = 0, cost = 999999;
		for (int i = 0; i < 960; i++) {
			vector<int> hist(9);
			for (int j = 0; j < 960; j++) {
				if (!avail[j]) continue;
				hist[dist(conf[i], conf[j])]++;
			}

			int cs = *max_element(hist.begin(), hist.end());
			if (cs < cost) {
				cost = cs;
				cz = i;
			}
		}

		cout << conf[cz] << endl;
		int x; cin >> x;
		if (x == 8) return;

		for (int i = 0; i < 960; i++) {
			if (!avail[i]) continue;
			if (dist(conf[i], conf[cz]) != x) avail[i] = 0;
		}
	}

	for (int i = 0; i < 960; i++) {
		if (avail[i] == 1) {
			cout << conf[i] << endl;
			int x; cin >> x; 
			return;
		}
	}

	assert(0);
}

signed main() {
	//ios::sync_with_stdio(0); cin.tie(0);
	srand(time(NULL));
	init();

	string s; int ts;
	while (cin >> s) {
		if (s == "END") break;
		cin >> ts;
		solve();
	}

	return 0;
}