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

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

const int N = 1e3;

int dist[N][N];
vector<string> tab;

void precalc () {
    string s = "RRKQBBNN";

    sort (all (s));

    auto check = [&] (string t) {
        vector<int> R;
        for (int i = 0; i < 8; i++) if (s[i] == 'R') R.pb(i);
        for (int i = 0; i < 8; i++) if (s[i] == 'K') {
            if (i < R[0] || R[1] < i) return false;
        }
        int par = 0;
        for (int i = 0; i < 8; i++) if (s[i] == 'B') if (i & 1) par++;
        if (par != 1) return false;
        return true;
    };

    do {
        if (check (s)) tab.pb (s);
    } while (next_permutation (all (s)));
    // dbg (tab.size ());

    for (int i = 0; i < tab.size (); i++) {
        for (int j = 0; j < tab.size (); j++) {
            for (int k = 0; k < 8; k++) dist[i][j] += (tab[i][k] == tab[j][k]);
        }
    }
}

void solve () {
    vector<int> ativos;
    for (int i = 0; i < 960; i++) ativos.pb (i);

    auto find_best_tab = [&] () -> int {
        vector<int> val (960, 1e12);
        int best = 1e12;
        for (int j = 0; j < 960; j++) {
            vector<int> f(9);
            for (auto u : ativos) f[dist[j][u]]++;

            int mx = 0;
            for (int i = 0; i <= 8; i++) mx = max (mx, f[i]);

            val[j] = mx;
            best = min (best, mx);
        }

        for (int j = 0; j < 960; j++) if (best == val[j]) return j;
        assert (0);
        return -1;
    };

    auto play = [&] (int j) -> bool {
        cout << tab[j] << endl;

        int filtro; cin >> filtro;
        if (filtro == 8) return 1;

        vector<int> add;
        for (auto u : ativos) if (dist[j][u] == filtro) add.pb (u);
        swap (add, ativos);
        return 0;
    };

    while (true) {
        int j = find_best_tab ();

        if (play (j)) break;

        if (ativos.size () == 1) {
            cout << tab[ativos[0]] << endl;
            int x; cin >> x;assert (x == 8);
            break;
        }
    }
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
    precalc ();

    while (true) {
        string op; cin >> op;
        if (op == "END") exit (0);
        int x; cin >> x;
        solve ();
    }
}