#include <bits/stdc++.h>
using namespace std;
int c, R, Q, K, B, N; char s[5555][10], a[10], ss[100];
int cnt, id[5555];
void dfs(int t) {
	if (t == 8) {
		int _ = 0;
		for (int i=0; i<8; i++)
			if (a[i] == 'B') _ ^= i;
		if (! (_ & 1)) return ;
		c ++;
		for (int i=0; i<8; i++)
			s[c][i] = a[i];
		return ;
	}
	if (R == 1 && ! K) a[t] = 'K', K ++, dfs(t+1), K --;
	if (! Q) a[t] = 'Q', Q ++, dfs(t+1), Q --;
	if (! R || R == 1 && K) a[t] = 'R', R ++, dfs(t+1), R --;
	if (B < 2) a[t] = 'B', B ++, dfs(t+1), B --;
	if (N < 2) a[t] = 'N', N ++, dfs(t+1), N --;
}
int calc(int i, int j) {
	int res = 0;
	for (int t=0; t<8; t++)
		res += s[i][t] == s[j][t];
	return res;
}
int diff[5555][5555];
int main() { srand(time(0));
	dfs(0);
	for (int i=1; i<=c; i++)
		for (int j=1; j<=c; j++)
			diff[i][j] = calc(i, j);
	while (1) {
		scanf ("%s", ss);
		if (ss[0] == 'E') return 0;
		scanf ("%*d");
		cnt = c; for (int i=1; i<=c; i++) id[i] = i;
		while (1) {
			if (cnt == 1) { printf ("%s\n", s[id[1]]), fflush (stdout), scanf ("%*d"); break; }
			int mn = 1e9, best;
			for (int i=1; i<=c; i++) {
				int mx = 0, c[9] {};
				for (int j=1; j<=cnt; j++)
					c[diff[i][id[j]]] ++;
				for (int j=0; j<=8; j++)
					mx = max(mx, c[j]);
				if (mx < mn) mn = mx, best = i;
			}
			printf ("%s\n", s[best]), fflush (stdout);
			int x; scanf ("%d", &x); if (x == 8) break;
			int _cnt = 0;
			for (int j=1; j<=cnt; j++)
				if (diff[best][id[j]] == x)
					id[++_cnt] = id[j];
			cnt = _cnt;
		}
	}
}