#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
vector<string> HAICHI;

ll sm(string A, string B) {
    ll res = 0;
    rep(i, A.size()) {
        if (A[i] == B[i])res++;
    }
    return res;
}

int main() {

    string P = "RRRQBBNN";
    sort(all(P));
    do {
        string H = P;
        vll knight;
        ll R = 0;
        rep(i, 8) {
            if (H[i] == 'R') {
                R++;
                if (R == 2)H[i] = 'K';
            }
            if (H[i] == 'B') {
                knight.push_back(i);
            }
        }
        if ((knight[0] + knight[1]) % 2 == 1) {
            HAICHI.push_back(H);
        }
    } while (next_permutation(all(P)));

    vvll smH(960, vll(960));
    rep(i, 960)rep(j, 960)smH[i][j] = sm(HAICHI[i], HAICHI[j]);

    string SS;
    cin>>SS;
    while(SS[0]=='G') {
        
        ll gamid;
        cin>>gamid;
        vll kouho(960);
        rep(i, 960)kouho[i] = i;

        rep(t, 6) {
            vll NK;
            ll siz = kouho.size();
            ll cid = 0;
            ll MM = 1e18;
            rep(i, siz) {
                vll DP(9, 0);
                rep(j, siz) {
                    DP[smH[kouho[i]][kouho[j]]]++;
                }
                ll MA = -1;
                rep(k, 9) {
                    chmax(MA, DP[k]);
                }
                if (chmin(MM, MA))cid = kouho[i];
            }
            if(t==0)cid=43;
            string FM = HAICHI[cid];
            cout << FM<<"\n";
            fflush(stdout);
            ll sam;
            cin>>sam;
            //cin >> sam;
            //sam=sm(HAICHI[0],FM);
            //cout<<sam<<endl;
            //if(sam==0)break;
            if (sam == 8)break;
            for (auto k : kouho) {
                if (smH[cid][k] == sam)NK.push_back(k);
            }
            kouho = NK;
			if(kouho.size()==0)return 0;
			//if(t==5&&kouho.size()!=1)return 0;
            //cout<<NK.size()<<endl;
        }
        cin>>SS;
    }
    return 0;
    //return 0;
}