# include <bits/stdc++.h>
using namespace std;
vector <string> p,temp;
int gs[10];
int main()
{
    string a="QKRRBBNN";
    sort(a.begin(),a.end());
    do
    {
        int R1=a.find('R'),R2=a.find_last_of('R'),K=a.find('K');
        if(K<R1 || K>R2) continue;
        int B1=a.find('B'),B2=a.find_last_of('B'); 
        if(B1%2==B2%2) continue;
        p.push_back(a);
    }while(next_permutation(a.begin(),a.end()));
    // printf("%d\n",p.size());
    // return 0;
    string ss;
    while(cin>>ss)
    {
        if(ss=="END") break;
        int x; scanf("%d",&x);
        auto now=p;
        string tmp="RKRBBNNQ";
        while(1)
        {
            if(now.size()==960) tmp="RBBNNQKR";
            else
            {
                double res=1e18;
                for(string a:now)
                {
                    memset(gs,0,sizeof(gs));
                    for(string b:now)
                    {
                        int cnt=0;
                        for(int i=0;i<8;i++) if(a[i]==b[i]) cnt++;
                        gs[cnt]++;
                    }
                    double nowres=0;
                    for(int i=0;i<=8;i++) 
                        if(gs[i]) nowres+=gs[i]*log(gs[i])*(gs[i]);
                    if(nowres<res) res=nowres,tmp=a;
                }
            }
            cout<<tmp<<endl; fflush(stdout);
            int num; scanf("%d",&num);
            if(num==8) break;
            temp.clear();
            for(string a:now)
            {
                int cnt=0;
                for(int i=0;i<8;i++) if(a[i]==tmp[i]) cnt++;
                if(cnt==num) temp.push_back(a);
            }   
            now=temp;
        }
    }
    return 0;
}