//https://qoj.ac/contest/1356/problem/7179
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 960
ll occ[MAXN][MAXN];
string dd[MAXN];
bool mm[MAXN];
ll Find_G(ll j)
{
    ll cnt[9];
    for(int i=0;i<9;i++) cnt[i]=0;
    for(int i=0;i<MAXN;i++)
    {
        if (mm[i]) cnt[occ[i][j]]++;
    }
    ll mx=0;
    for(int i=0;i<9;i++) mx=max(mx,cnt[i]);
    return mx;
}
bool GG(string s)
{
    ll pos[2][2],poss=-1;
    pos[0][0]=pos[0][1]=pos[1][0]=pos[1][1]=-1;
    for(int i=0;i<s.size();i++)
    {
        if(s[i]=='K') poss=i;
        if(s[i]=='R') pos[0][pos[0][0]!=-1]=i;
        if(s[i]=='B') pos[1][pos[1][0]!=-1]=i;
    }
    return ((pos[1][0]&1)!=(pos[1][1]&1) && pos[0][0]<poss && poss<pos[0][1]);
}
int main()
{
    //ios::sync_with_stdio(false), cin.tie(NULL);
    string s="BBKNNQRR"; ll nxt=0;
    if(GG(s)) dd[nxt++]=s;
    while(next_permutation(all(s)))
    {
        if(GG(s)) dd[nxt++]=s;
    }
    for(int i=0;i<MAXN;i++)
    {
        for(int j=0;j<MAXN;j++)
        {
            for(int k=0;k<8;k++) occ[i][j]+=(dd[i][k]==dd[j][k]);
        }
    }
    string ss; cin>>ss;
    while(ss!="END")
    {
        ll t,cntt=0,rez,idx,mn; cin>>t;
        for(int i=0;i<MAXN;i++) mm[i]=true;
        bool check=false;
        while(cntt<6 && !check)
        {
            cntt++; mn=INF;
            for(int i=0;i<MAXN;i++)
            {
                if(Find_G(i)<mn+mm[i]) {mn = Find_G(i),idx=i;}
            }
            cout<<dd[idx]<<endl; cin>>rez;
            for(int i=0;i<MAXN;i++)
            {
                if(mm[i]) mm[i]=(occ[idx][i]==rez);
            }
            if(rez==8) check=true;
        }
        if(!check && cntt==6) return 0;
        cin>>ss;
    }
    return 0;
}