#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U>
void debug(T a, U ... b){ cout << a << " ", debug(b...); }
template<class T> void pary(T l, T r){
	while(l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}
bool testing = 0;
int queries = 0;
string qs;
int match(string &s, string &t) {
	int ret = 0;
	for (int i = 0;i < 8;i++)ret += s[i] == t[i];
	return ret;
}
int query(string &s) {
	int ret;
	if (testing) {
		queries++;
		ret = match(s, qs);
	} else {
		cout << s << endl;
		cin >> ret;
	}
	return ret;
}
vector<string> allstr;
void solve(vector<string> can) {
	if (can.size() == 1) {
		query(can[0]);
		return;
	}
	string best;
	int bval = 1000;
	for (auto s:allstr) {
		vector<int> cnt(9);
		for (auto t:can) {
			cnt[match(s, t)]++;
		}
		int ma = *max_element(cnt.begin(), cnt.end());
		if (ma < bval) {
			bval = ma;
			best = s;
		}
	}
	int que = query(best);
	if (que == 8) return;
	vector<string> rec;
	for (auto s:can) {
		if (match(s, best) == que) rec.push_back(s);
	}
	solve(rec);
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	vector<string> can;
	string s = "BBKNNQRR";
	do {
		int bodd = 0, beven = 0;
		int kp = 0, rp1 = -1, rp2 = -1;
		for (int i = 0;i < 8;i++) {
			if (s[i] == 'B') {
				if (i %2) bodd++;
				else beven++;	
			} else if (s[i] == 'K') {
				kp = i;
			} else if (s[i] == 'R') {
				if (rp1 == -1) rp1 = i;
				else rp2 = i;
			}
		}
		if (bodd && beven && rp1 < kp && kp < rp2) can.push_back(s);	
	} while (next_permutation(s.begin(), s.end()));
	allstr = can;
	if (testing) {
		for (string str:can) {
			qs = str;
			queries = 0;	
			solve(can);
			if (queries > 6) {
				debug("Bad", str);
			}
		}
		return 0;
	}
	string game;
	int gn;
	while (cin >> game) {
		if (game == "END") break;
		cin >> gn;
		solve(can);
	}

}