#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < ll(n); i++)
#define repll3(i, a, b) for (ll i = a; i < ll(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < ll(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = n - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= ll(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= ll(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
    
vector<string> narabi;

void solve() {
    vector<string> kouho = narabi;
    int mth;
    while((int)kouho.size() > 1) {
        int mx = inf;
        string op;
        fore(na, narabi) {
            vector<int> cnt(9, 0);
            fore(ko, kouho) {
                int res = 0;
                rep(i, 8) res += ko[i] == na[i];
                cnt[res]++;
            }
            if (*max_element(all(cnt)) < mx) {
                mx = *max_element(all(cnt));
                op = na;
            }
        }
        cout << op << endl;
        cout.flush();
        cin >> mth;
        if (mth == 8) return;
        vector<string> pre = kouho;
        kouho.clear();
        fore(ko, pre) {
            int res = 0;
            rep(i, 8) res += ko[i] == op[i];
            if (res == mth) kouho.push_back(ko);
        }
    }
    cout << kouho[0] << endl;
    cout.flush();
    cin >> mth;
}

int num[26];
int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    string W = "RRKBBNNQ";
    num['R' - 'A'] = 0;
    num['B' - 'A'] = 1;
    num['N' - 'A'] = 2;
    num['K' - 'A'] = 3;
    num['Q' - 'A'] = 4;
    sort(all(W));

    do {
        vector<int> zahyo[5];
        rep(i, 8) {
            zahyo[num[W[i] - 'A']].push_back(i);
        }
        if (zahyo[0][0] < zahyo[3][0] && zahyo[3][0] < zahyo[0][1] && (zahyo[1][0] + zahyo[1][1]) % 2) narabi.push_back(W);
    } while(next_permutation(all(W)));

    string S;
    while (true) {
        cin >> S;
        if (S == "END") break;
        int tmp;
        cin >> tmp;
        solve();
    }
}