/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
vector <string> sta;
char chs[8]={'B','B','K','R','R','Q','N','N'};
int ok[1005],dist[1005][1005];
int getdist(int u,int v)
{
	int r=0;
	if(sta[u][0]==sta[v][0]) r++;
	if(sta[u][1]==sta[v][1]) r++;
	if(sta[u][2]==sta[v][2]) r++;
	if(sta[u][3]==sta[v][3]) r++;
	if(sta[u][4]==sta[v][4]) r++;
	if(sta[u][5]==sta[v][5]) r++;
	if(sta[u][6]==sta[v][6]) r++;
	if(sta[u][7]==sta[v][7]) r++;
	return r;
}
int cnt[11];
void solve()
{
	while(1)
	{
		string dirt;
		cin>>dirt;
		if(dirt=="END") return;
		cin>>dirt;
		for(int i=0;i<sta.size();i++) ok[i]=1;
		vector <int> okid;
		okid.clear();
		bool fnd=0;
		for(int _=0;_<5;_++)
		{
			okid.clear();
			for(int i=0;i<sta.size();i++) if(ok[i]) okid.pb(i);
			int minn=inf,u=-1;
			for(int i=0;i<sta.size();i++)
			{
				memset(cnt,0,sizeof(cnt));
				for(int j=0;j<okid.size();j++) cnt[dist[i][okid[j]]]++;
				int mx=0;
				for(int j=0;j<=8;j++) mx=max(mx,cnt[j]);
				if(mx<minn) minn=mx,u=i;
			}
			cout<<sta[u]<<"\n";
			fflush(stdout);
			int x;
			cin>>x;
			if(x==8)  
			{
				fnd=1;
				break;
			}
			for(int j=0;j<okid.size();j++) if(dist[u][okid[j]]!=x) ok[okid[j]]=0;
		}
		if(!fnd)
		{
			okid.clear();
			for(int i=0;i<sta.size();i++) if(ok[i]) okid.pb(i);
			cout<<sta[okid[0]]<<"\n";
			fflush(stdout);
			cin>>dirt;
		}
		
//		cout<<okid.size()<<"\n";
//		assert(okid.size()==1);
		
		
	}
}
signed main()
{
	do
	{
		string s;
		for(int i=0;i<8;i++) s+=chs[i];
		bool okk=1;
		int lr=inf,rr=-1,lb=inf,rb=-1,k=-1;
		for(int i=0;i<8;i++)
		{
			if(s[i]=='B') lb=min(lb,i),rb=max(rb,i);
			if(s[i]=='K') k=i;
			if(s[i]=='R') lr=min(lr,i),rr=max(rr,i);
		}
		if(lb%2==rb%2) okk=0;
		if(k<lr||k>rr) okk=0;
		if(okk) sta.pb(s);
	}while(next_permutation(chs,chs+8));
	for(int i=0;i<sta.size();i++) for(int j=0;j<sta.size();j++) dist[i][j]=getdist(i,j);
//	cout<<sta.size()<<"\n";
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}