#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
	re int t=0;re char v=getchar();
	while(v<'0')v=getchar();
	while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
	return t;
}
const int M=998244353;
inline void add(re int &x,re int y){(x+=y)>=M?x-=M:x;}
inline int Mod(re int x){return x>=M?x-M:x;}
inline int ksm(re int x,re int y){
	re int s=1;
	while(y){
		if(y&1)s=1ll*s*x%M;
		x=1ll*x*x%M,y>>=1;
	}
	return s;
}
int t,n,m,a[1000002],T[1002][12],tot,sz[12],mx,Tr[1002];
char s[12];
inline int Ask(re int x,re int y){
	re int s=0;
	for(re int i=1;i<=8;++i)s+=T[x][i]==T[y][i];
	return s;
}
inline int Ask(re int x){
	for(re int i=1;i<=8;++i)putchar(Tr[T[x][i]]);
	puts("");fflush(stdout);return read();
}
inline void Solve(vector<int>A,re int dep){
	mx=max(mx,dep);
	if(A.size()<=1){
		Ask(A[0]);
		return;
	}
	re double MN=1e9;re int pos=0;
	for(re int i=1;i<=tot;++i){
		memset(sz,0,sizeof(sz));
		for(auto z:A)++sz[Ask(z,i)];
		double O=0;
		for(re int j=0;j<=8;++j){
			double P=1.0*sz[j]/A.size();
			if(P>0)O+=P*log(P);
		}
		if(O<MN)MN=O,pos=i;
	}
	vector<int>Q[9];
	for(auto z:A)Q[Ask(z,pos)].push_back(z);
int oo=Ask(pos);
if(oo==8)return;
	Solve(Q[oo],dep+1);
}
int main(){
	n=8;
	a[1]=1,a[2]=1,a[3]=2,a[4]=2,a[5]=3,a[6]=3,a[7]=4,a[8]=5;
	do{
		int p1=0,p2=0,pos=0,ia=1;
		for(re int i=1;i<=8;++i)
			if(a[i]==1)
				p1=p2,p2=i;
			else if(a[i]==5)
				pos=i;
		if(pos<p1||pos>p2)ia=0;
		for(re int i=1;i<=8;++i)
			if(a[i]==3)
				p1=p2,p2=i;
		if((p1^p2)%2==0)ia=0;
		if(ia){
			++tot;
			for(re int i=1;i<=8;++i)T[tot][i]=a[i];
		}
	}while(next_permutation(a+1,a+9));
	while(1){
		scanf("%s",s);
		if(s[0]=='E')break;
		t=read();
		Tr[1]='R',Tr[2]='N',Tr[3]='B',Tr[4]='Q',Tr[5]='K';
		vector<int>A;
		for(re int i=1;i<=tot;++i)A.push_back(i);
		Solve(A,0);
	}
}