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

int ss(string& s, string& t) {
    int res = 0;
    for (int i = 0; i < 8; ++i) res += s[i] == t[i];
    return res;
}

#ifdef LOCAL
string ans = "RKRBBQNN";
int ask(string s) {
    cout << s << endl;
    int ret = ss(ans, s);
    cout << ret << endl;
    return ss(ans, s);
}
#else
int ask(string s) {
    cout << s << endl;
    int cnt;
    cin >> cnt;
    return cnt;
}
#endif

int main() {
    vector<string> start;
    string s = "KQRRBBNN";
    vector<int> p(8);
    iota(p.begin(), p.end(), 0);
    do {
        string t(8, '#');
        for (int i = 0; i < 8; ++i) {
            t[p[i]] = s[i];
        }
        map<char, vector<int>> pos;
        for (int i = 0; i < 8; ++i) pos[t[i]].push_back(i);
        bool ok = true;
        ok &= pos['R'][0] < pos['K'][0] && pos['K'][0] < pos['R'][1];
        ok &= (pos['B'][0] % 2) != (pos['B'][1] % 2);
        if (ok) start.push_back(t);
    } while (next_permutation(p.begin(), p.end()));
    sort(start.begin(), start.end());
    start.resize(unique(start.begin(), start.end()) - start.begin());
    int n;
    while (cin >> s) {
        if (s == "END") break;
        cin >> n;
        auto cand = start;
        while (true) {
            if (cand.size() == 1) {
                ask(cand[0]);
                break;
            }
            string mn;
            int x = 1e9;
            for (auto tt : start) {
                vector<int> cnt(9);
                for (auto i : cand) cnt[ss(tt, i)]++;
                int mx = *max_element(cnt.begin(), cnt.end());
                if (mx < x) {
                    x = mx;
                    mn = tt;
                }
            }
            int cnt = ask(mn);
            if (cnt == 8) break;
            vector<string> nxt;
            for (auto& i : cand) {
                if (ss(i, mn) == cnt) {
                    nxt.push_back(i);
                }
            }
            cand = nxt;
        }
    }
}