#include <bits/stdc++.h>
using namespace std;

#define all(v) begin(v),end(v)
#ifdef CKISEKI
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif


string ans;
int ask(string s) {
    cout << s << endl;
    int c = 0;
    cin >> c;
    // for (int i = 0; i < 8; i++)
    //     if (ans[i] == s[i])
    //         ++c;
    // debug(ans, s);
    // cerr << "c = " << c << endl;
    return c;
}

int main() {
    // cin.tie(nullptr)->sync_with_stdio(false);

    string P = "RQKBBNRN";
    ans = "RKRBBQNN";
    sort(P.begin(), P.end());

    vector<string> z;
    do {
        vector<int> B, R, K;
        for (int i = 0; i < 8; i++)
            if (P[i] == 'B')
                B.push_back(i);
            else if (P[i] == 'R')
                R.push_back(i);
            else if (P[i] == 'K')
                K.push_back(i);

        if (B[0] % 2 == B[1] % 2) continue;
        if (!(min(R[0], R[1]) < K[0] && K[0] < max(R[0], R[1])))
            continue;
        z.emplace_back(P);
    } while (next_permutation(all(P)));

    debug(z.size());

    string command;
    while (cin >> command && command == "GAME") {
        int g;
        cin >> g;

        vector<string> cur = z;

        while (cur.size() > 1) {
            vector<pair<int,string>> s;
            for (auto to_ask: z) {
                int mp[9] = {};
                for (auto x: cur) {
                    int score = 0;
                    for (int i = 0; i < 8; i++)
                        score += x[i] == to_ask[i];
                    mp[score] += 1;
                }
                // s.emplace_back();
                int mx = *max_element(mp, mp+9);
                s.emplace_back(mx, to_ask);
            }

            auto [mn, to_ask] = *min_element(s.begin(), s.end());

            {
                int mp[9] = {};
                for (auto x: cur) {
                    int score = 0;
                    for (int i = 0; i < 8; i++)
                        score += (x[i] == to_ask[i]);
                    mp[score] += 1;
                }
                orange(mp, mp+9);
            }
            debug(mn);
            int cnt = ask(to_ask);
            if (cnt == 8)
                goto end;

            vector<string> tmp;
            for (auto x: cur) {
                int score = 0;
                for (int i = 0; i < 8; i++)
                    score += (x[i] == to_ask[i]);
                if (score == cnt)
                    tmp.emplace_back(x);
            }

            cur = tmp;
            debug(cur.size());
        }

        ask(cur[0]);
end:
        ;

    }

    return 0;
}