#include<bits/stdc++.h>
using namespace std;
char ch[960][9],s[9]; 
int cnt,f[960],nowf,num[960][9],q,n,b,r,k,qu[960][960],itask,iask;
void dfs(int x){
	if (x==8){
		for (int i=0;i<8;i++) ch[cnt][i]=s[i];
		cnt++;
		return;
	}
	//Queen
	if (q==0){
		s[x]='Q';
		q=1;
		dfs(x+1);
		q=0;
	}
	//kNight
	if (n<2){
		s[x]='N';
		n++;
		dfs(x+1);
		n--;
	}
	//Bishop
	if (b==-1){
		s[x]='B';
		b=x;
		dfs(x+1);
		b=-1;
	}
	else if (b>=0&&((b&1)!=(x&1))){
		int tmp=b;
		s[x]='B';
		b=-2;
		dfs(x+1);
		b=tmp;
	}
	//Rook
	if (r==0){
		s[x]='R';
		r=1;
		dfs(x+1);
		r=0;
	}
	else if (r==1&&k==1){
		s[x]='R';
		r=2;
		dfs(x+1);
		r=1;
	}
	//King
	if (r==1&&k==0){
		s[x]='K';
		k=1;
		dfs(x+1);
		k=0;
	}
}
int ask(){
	int res,ma;
	res=0; ma=cnt;
	for (int i=0;i<cnt;i++)
	for (int j=0;j<=8;j++) num[i][j]=0;
	
	for (int i=0;i<cnt;i++)
	if (f[i]){
		for (int j=0;j<cnt;j++) num[j][qu[i][j]]+=1;
	}
	
	for (int i=0;i<cnt;i++){
		int tmp=0;
		for (int j=0;j<=8;j++) tmp=max(tmp,num[i][j]);
		if (tmp<ma){
			ma=tmp;
			res=i;
		}
	}
	return res;
}

void work(){
	int tmp;
	scanf("%d",&tmp);
	for (int i=0;i<cnt;i++) f[i]=1;
	itask=iask;
	while (true){
		printf("%s\n",ch[itask]);
		fflush(stdout);
		scanf("%d",&tmp);
		if (tmp==8) return;
		
		nowf=0;
		for (int i=0;i<cnt;i++)
		if (f[i]&&qu[i][itask]==tmp){
			f[i]=1;
			nowf++;
		}
		else f[i]=0;
		if (nowf==1) break;
		itask=ask();
	}
	
	for (int i=0;i<cnt;i++)
	if (f[i]){
		printf("%s\n",ch[i]);
		fflush(stdout);
		scanf("%d\n",&tmp);
		break;
	}
	return;
}
int main(){
	b=-1;
	dfs(0);
	for (int i=0;i<cnt;i++)
	for (int j=0;j<cnt;j++){
		for (int k=0;k<8;k++)
			if (ch[i][k]==ch[j][k])
				qu[i][j]++;	
	}
	for (int i=0;i<cnt;i++) f[i]=1;
	iask=ask();
	
	scanf("%s",s);
	while (s[0]=='G'){
		work();
		scanf("%s",s);
	}
		
	/*
	for (int i=0;i<6;){
		
	}
	fflush(stdout);
	scanf("");
	*/
}