#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
typedef double db;
typedef long long LL;

typedef pair<int, int> pi;
#define fi first
#define se second
#define all0(x) (x).begin(), (x).end()

mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());

V<string> pos;

int same_cnt(string a, string b) {
    int cnt = 0;
    for(int i = 0; i < a.size(); i++) if(a[i] == b[i]) cnt++;
    return cnt;
}

bool hav(V<string> vs, string s) {
    for(auto x : vs) if(x == s) return 1;
    return 0;
}

const int N = 1000;
int same_tab[N][N];

void solve() {
    V<int> now(960);
    V<int> ids(960);
    iota(all0(now), 0);
    iota(all0(ids), 0);

    int cnt = 0;
    while(now.size() > 1) {

        cnt++;
        assert(cnt <= 5);
        int mn = 10000;
        // string use;
        int useid;
        for(auto s : ids) {
            V<int> hav(9);
            for(auto t : now) {
                hav[same_tab[s][t]]++;
            }
            int mx = *max_element(all0(hav));
            if(mx < mn) {
                mn = mx, useid = s;
            }
        }

        cout << pos[useid] << endl;
        int t; cin >> t;
        // cout << t << endl;
        if(t == 8) {
            return;
        }
        V<int> n_now;
        for(auto s : now) {
            if(same_tab[s][useid] == t) n_now.pb(s);
        }
        swap(now, n_now);
    }
    cout << pos[now[0]] << endl;
    int t; cin >> t;
    // int t = same_tab[now[0]][set_ans];
    assert(t == 8);
}

bool king_in_rock(string s) {
    int f_r = -1, l_r, k;
    for(int i = 0; i < s.size(); i++) {
        if(s[i] == 'K') k = i;
        if(f_r == -1 && s[i] == 'R') f_r = i;
        if(s[i] == 'R') l_r = i;
    }
    if(k > f_r && k < l_r) return 1;
    return 0;
}
bool bishop_in_dif(string s) {
    int hav0 = 0, hav1 = 0;

    for(int i = 0; i < s.size(); i++) {
        if(s[i] == 'B') {
            if(i & 1) hav1++;
            else hav0++;
        }
    }

    if(hav1 == 1) return 1;
    return 0;
}

void initial() {
    string s = "NNKQBBRR";
    sort(all0(s));
    do{
        if(bishop_in_dif(s) && king_in_rock(s)) pos.pb(s);
    }while(next_permutation(all0(s)));
}

int main() {

    initial();

    for(int i = 0; i < 960; i++) for(int j = 0; j < 960; j++) {
        same_tab[i][j] = same_cnt(pos[i], pos[j]);
    }

    string s; cin >> s;
    while(s != "END") {
        int t; cin >> t;
        solve();
        // cout << "solve end" << endl;
        cin >> s;
    }


    // int t = 960;
    // while(t--) {
    //     solve(t - 1);
    //     cout << t << endl;
    // }
}