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

#define sz(x) (int)x.size()

bool check(string s) {
    vector<int> was[30];
    for (int i = 0; i < sz(s); ++i) {
        was[s[i] - 'A'].push_back(i);
    }
    if (was['R' - 'A'][0] > was['K' - 'A'][0] || was['K' - 'A'][0] > was['R' - 'A'][1]) {
        return 0;
    }
    if ((was['B' - 'A'][0] + was['B' - 'A'][1]) % 2 == 0) {
        return 0;
    }
    return 1;
}

int get(string s, string t) {
    int ans = 0;
    for (int i = 0; i < sz(s); ++i)
        if (s[i] == t[i]) ans++;
    return ans;
}

vector<string> v;

string find(set<string> p) {
    int was[20];
    int mx = 100;
    string t;
    for (auto i : p) {
        for (int j = 0; j <= 10; ++j) was[j] = 0;
        for (auto j : p) {
            was[get(i, j)]++;
        }
        int now = 0;
        for (int j = 0; j <= 8; ++j) now = max(now, was[j]);
        if (now < mx) {
            mx = now;
            t = i;
        }
    }
    return t;
}
/*
int solve(string T, int st = 0) {
    string s;
    vector<string> p;
    s = v[st];
    s = "BBNRKNRQ";
    int ans = 1;
    int k = get(s, T);

    if (k == 8) {
        return 1;
    }
    for (auto i : v) {
        if (get(i, s) == k) {
            p.push_back(i);
        }
    }
    while (p.size() > 1) {
        s = find(p);
        ans++;
        k = get(s, T);
        if (k == 8) {
            return ans;
        }
        vector<string> pp;
        for (auto i : v) {
            if (find(p.begin(), p.end(), i) != p.end() && get(i, s) == k) {
                pp.push_back(i);
            }
        }
        p = pp;
    }
    ans++;
    return ans;
}
*/
int make(string T = "") {

    set<string> p;
    string s = "BBNRKNRQ";
    cout << s << endl;
    int ans = 1;
    int k;
    if (T == "")
        cin >> k;
    else 
        k = get(s, T);
    if (k == 8) return ans;

    for (auto i : v) {
        if (get(i, s) == k) {
            p.insert(i);
        }
    }
    while (p.size() > 1) {
        s = find(p);
        cout << s << endl;
        ans++;
        if (T == "")
            cin >> k;
        else 
            k = get(s, T);
        if (k == 8) {
            return ans;
        }
        set<string> pp;
        for (auto i : v) {
            if (p.count(i) && get(i, s) == k) {
                pp.insert(i);
            }
        }
        p = pp;
    }
    cout << *p.begin() << endl;
    if (T == "")
        cin >> k;
    else 
        k = get(s, T);
    return ans;
}

int main() {
    string s = "RQKBBNRN";
    sort(s.begin(), s.end());
    while (true) {
        if (check(s)) v.push_back(s);
        if (!next_permutation(s.begin(), s.end())) break;
    }
    string g;
    int n;
    while (true) {
        cin >> g;
        if (g == "END") break;
        cin >> n;
        make();
    }
}