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

const ll N = 1e6 + 1;
const ll M = 1e9 + 7;

vector<string> v, res;
string S[] = {"NRBBNQKR", "RKBBNQRN", "BBNNQRKR", "BBRKNNRQ", ""};
ll val[N];

ll cal(string &s, string &t) {
    ll res = 0;
    for (int i = 0; i <= 7; i ++)
        if (s[i] == t[i]) res ++;
    return res;
}

void doTest(ll testID) {
    string tmp; cin >> tmp >> tmp;
    for (int i = 0; i < 4; i ++) {
        cout << S[i] << endl;
        
        cin >> tmp; if (tmp == "END") return;
        val[i] = stoll(tmp);
    }

    res.clear();
    for (auto x: v) {
        bool ok = 1;
        for (int i = 0; i < 4; i ++)
            if (cal(x, S[i]) != val[i]) {ok = 0; break;}
        if (ok) res.push_back(x);
    }

    for (auto x: v) {
        set<ll> s;
        for (auto y: res) s.insert(cal(x, y));
        if (s.size() == res.size()) {
            S[4] = x;
            cout << S[4] << endl;
            cin >> tmp; if (tmp == "END") return;
            val[4] = stoll(tmp);
            break;
        }
    }

    for (auto x: v) {
        bool ok = 1;
        for (int i = 0; i < 5; i ++)
            if (cal(x, S[i]) != val[i]) {ok = 0; break;}
        if (ok) {
            cout << x << endl;
            break;
        }
    }
    cin >> tmp >> tmp;
}

signed main() {    
    set<string> s;
    string T = "KNNBBRRQ";
    sort(T.begin(), T.end());
    do {
        vector<ll> b, r, k;
        for (int i = 0; i <= 7; i ++) if (T[i] == 'B') b.push_back(i);
        for (int i = 0; i <= 7; i ++) if (T[i] == 'K') k.push_back(i);
        for (int i = 0; i <= 7; i ++) if (T[i] == 'R') r.push_back(i);
        if ((b[1] - b[0]) % 2 == 0) continue;
        if (r[0] > k[0] || r[1] < k[0]) continue;
        s.insert(T);
    } while(next_permutation(T.begin(), T.end()));
    for (auto x: s) v.push_back(x);

    ios_base::sync_with_stdio(0); cin.tie(0);

    int test = 1; 
    // cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(test);
}