#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
const int N = 800005;

vector <string> G,iG;
map <string,int> mp; int tot = 0;

void init1(){
    string s = "BBKNNQRR";
    do{
        int pk; vector <int> pb,pr;
        for(int i = 0;i < 8;i ++){
            if(s[i] == 'B') pb.push_back(i);
            if(s[i] == 'R') pr.push_back(i);
            if(s[i] == 'K') pk = i;
        }
        if((pb[0] & 1) == (pb[1] & 1)) continue;
        if(!(pr[0] < pk && pk < pr[1])) continue;
        if(mp.find(s) != mp.end()) continue;
        mp[s] = tot ++;
        G.push_back(s);
    }while(next_permutation(s.begin(),s.end()));
}

mt19937 rnd(998244353);
string SS;

int calc(string x,string y){ int r = 0; for(int i = 0;i < 8;i ++) if(x[i] == y[i]) r ++; return r; }

void solve(){
    vector <string> H;
    G = iG;
    string lis[6];
    for(int ti = 0;ti < 5;ti ++){
        if(G.size() == 1) break;
        string cur;
        bool flg = 0;
        for(auto &x:G) if(x=="RQNKRBBN") flg = 1;
		if(ti > 0){
            if(!flg){
                db anss = 0;
                for(int x = 0;x < G.size();x ++){
                    map <int,int> chk;
                    for(int i = 0;i < G.size();i ++) chk[calc(G[i],G[x])] ++;
                    db mx = 0;
                    for(auto it = chk.begin();it != chk.end();it ++){
                        db val = 1.0 * it->second / G.size();
                        mx += val * log2(1.0 / val);
                    }
                    if(mx > anss){
                        anss = mx;
                        cur = G[x];
                    }
                }
            }else{
                int anss = 1e9;
                for(int x = 0;x < G.size();x ++){
                    map <int,int> chk;
                    for(int i = 0;i < G.size();i ++) chk[calc(G[i],G[x])] ++;
                    int mx = 0;
                    for(auto it = chk.begin();it != chk.end();it ++) mx = max(mx,it->second);
                    if(mx < anss){
                        anss = mx;
                        cur = G[x];
                    }
                }
            }
		}else{
			cur = "RBBNNQKR";
		}
        cout << cur << endl;
        int x;
        cin >> x;
        // x = calc(cur,SS);
        if(x == 8) return;
        for(int i = 0;i < G.size();i ++) if(calc(cur,G[i]) == x) H.push_back(G[i]);
        G.swap(H); H.clear();
        lis[ti] = cur;
    }
    cout << G[0] << endl;
    int x;
    cin >> x;
    // x = calc(SS,G[0]);
    // if(x != 8) cout << SS << endl;
}


int main(){
    ios::sync_with_stdio(false);
    init1();
    iG = G;
    // for(auto s : iG){
        // SS = s; solve();
    // }
    string str;
    while(cin >> str){
        if(str == "END") break;
        int x; cin >> x;
        // cin >> SS;
        solve();
    }
    return 0;
}