#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 100005;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    vector <string> vec;
    {
        string s = "KQBBNNRR";
        sort(all(s));
        do {
            int l = 9, r = -1;
            for (int i = 0; i < 8; ++i) if (s[i] == 'R') {
                l = min(l, i), r = max(r, i);
            }
            int x = find(all(s), 'K') - s.begin();
            if (l <= x && x <= r) {
                int l = 9, r = -1;
                for (int i = 0; i < 8; ++i) if (s[i] == 'B') {
                    l = min(l, i), r = max(r, i);
                }
                if ((r - l) & 1) {
                    vec.pb(s);
                }
            }
        } while (next_permutation(all(s)));
    }

    auto dis = [&](string s, string t) {
        int ans = 0;
        for (int i = 0; i < 8; ++i) {
            ans += s[i] == t[i];
        }
        return ans;
    };
    auto out = [&](string s) {
        cout << s << endl;
        int x; cin >> x;
        return x;
    };

    string op;
    while (cin >> op) {
        if (op == "GAME") {
            int _; cin >> _;
            vector <string> candidate = vec;
            while (candidate.size() > 1) {
                pair <int, string> res = {1 << 30, ""};
                for (string ask : vec) {
                    vector <int> cnt(9, 0);
                    for (string s : candidate) {
                        cnt[dis(ask, s)]++;
                    }
                    int mx = *max_element(all(cnt));
                    res = min(res, make_pair(mx, ask));
                }

                string ask = res.second;
                int tmp = out(ask);
                vector <string> nxt;
                for (string s : candidate) {
                    if (dis(s, ask) == tmp) {
                        nxt.pb(s);
                    }
                }
                candidate = nxt;
            }
            assert(out(candidate[0]) == 8);
        } else if (op == "END") {
            break;
        } else {
            assert(false);
        }
    }
}