#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


const ll inf = 1e18;
mt19937 rnd(234);


vector<string> good;


void build() {
    good.clear();
    string s = "KQRRBBNN";
    sort(all(s));
    while (1) {
        int rc = 0;
        bool ok = true;
        int wb = 0;
        for (int i = 0; i < 8; i += 1) {
            if (s[i] == 'R') {
                rc += 1;
            }
            if (s[i] == 'K') {
                if (rc != 1) {
                    ok = false;
                }
            }
            if (s[i] == 'B' and i % 2 == 0) {
                wb += 1;
            }
        }
        if (wb != 1) {
            ok = false;
        }
        if (ok) {
            good.push_back(s);
        }
        if (!next_permutation(all(s))) {
            break;
        }
    }
}


int operator&(const string &a, const string &b){
    int rs = 0;
    for(int i = 0; i < min((int)a.size(), (int)b.size()); i += 1){
        if(a[i] == b[i]){
            rs += 1;
        }
    }
    return rs;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    build();
    cerr << good.size() << "\n";
    while(1){
        string aboba;
        cin >> aboba;
        if(aboba == "END"){
            break;
        }
        assert(aboba == "GAME");
        int num;
        cin >> num;
        vector<string> rest = good;
        auto make_move = [&](string s){
            cout << s << endl;
            int x;
            cin >> x;
            if(x == 8){
                return true;
            }
            vector<string> nrest;
            for(auto &t: rest){
                if((s & t) == x){
                    nrest.push_back(t);
                }
            }
            rest.swap(nrest);
            return false;
        };
        auto get_goodness = [&](string s) -> flt {
            vector<int> cnt(9);
            for(auto &t: rest){
                cnt[t & s] += 1;
            }
            flt rs = 0;
            for(auto c: cnt){
                rs += c * log(max(c, 1));
            }
            return rs;
        };
        while(1){
            assert(!rest.empty());
            string s = rest[0];
            flt gdns = get_goodness(s);
            for(auto f: good){
                flt fgdns = get_goodness(f);
                if(fgdns < gdns){
                    s = f;
                    gdns = fgdns;
                }
            }
            if(make_move(s)){
                break;
            }
        }
    }
    return 0;
}