#include <bits/stdc++.h>
using namespace std;
template<typename T>
int SIZE(T (&t)){
    return t.size();
}

template<typename T, size_t N>
int SIZE(T (&t)[N]){
    return N;
}

string to_string(char t){
    return "'" + string({t}) + "'";
}

string to_string(bool t){
    return t ? "true" : "false";
}

string to_string(const string &t, int x1=0, int x2=1e9){
    string ret = "";
    for(int i = min(x1,SIZE(t)), _i = min(x2,SIZE(t)-1); i <= _i; ++i){
        ret += t[i];
    }
    return '"' + ret + '"';
}

string to_string(const char* t){
    string ret(t);
    return to_string(ret);
}

template<size_t N>
string to_string(const bitset<N> &t, int x1=0, int x2=1e9){
    string ret = "";
    for(int i = min(x1,SIZE(t)); i <= min(x2,SIZE(t)-1); ++i){
        ret += t[i] + '0';
    }
    return to_string(ret);
}

template<typename T, typename... Coords>
string to_string(const T (&t), int x1=0, int x2=1e9, Coords... C);

template<typename T, typename S>
string to_string(const pair<T, S> &t){
    return "(" + to_string(t.first) + ", " + to_string(t.second) + ")";
}

template<typename T, typename... Coords>
string to_string(const T (&t), int x1, int x2, Coords... C){
    string ret = "[";
    x1 = min(x1, SIZE(t));
    auto e = begin(t);
    advance(e,x1);
    for(int i = x1, _i = min(x2,SIZE(t)-1); i <= _i; ++i){
        ret += to_string(*e, C...) + (i != _i ? ", " : "");
        e = next(e);
    }
    return ret + "]";
}

template<int Index, typename... Ts>
struct print_tuple{
    string operator() (const tuple<Ts...>& t) {
        string ret = print_tuple<Index - 1, Ts...>{}(t);
        ret += (Index ? ", " : "");
        return ret + to_string(get<Index>(t));
    }
};

template<typename... Ts>
struct print_tuple<0, Ts...> {
    string operator() (const tuple<Ts...>& t) {
        return to_string(get<0>(t));
    }
};

template<typename... Ts>
string to_string(const tuple<Ts...>& t) {
    const auto Size = tuple_size<tuple<Ts...>>::value;
    return print_tuple<Size - 1, Ts...>{}(t);
}

void dbgr(){;}
template<typename Heads, typename... Tails>
void dbgr(Heads H, Tails... T){
    cout << to_string(H) << " | ";
    dbgr(T...);
}

void dbgs(){;}
template<typename Heads, typename... Tails>
void dbgs(Heads H, Tails... T){
    cout << H << " ";
    dbgs(T...);
}

/*
formatted functions:
*/

/*
consider __VA_ARGS__ as a whole:
dbgv() prints values only
dbg() prints name and values
*/
#define dbgv(...) cout << to_string(__VA_ARGS__) << endl;

#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgv(__VA_ARGS__);
//#define dbg(...)

/*
consider __VA_ARGS__ as a sequence of arguments:
dbgr() prints values only
dbgm() prints names and values
*/
#define dbgr(...) dbgr(__VA_ARGS__); cout << endl;

#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgr(__VA_ARGS__);

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
// using u128 = __uint128_t;
// using i128 = __int128;
const int mod = 1000000007;
const int N = 200005;
const int X = 960;
const int LOG = 20;
const int inf = 1e9;
const double eps = 1e-11;
char c[5] = {'K', 'R', 'B', 'N', 'Q'};
int idx = 0;
vector<vector<int>> positions(X);
void dfs(vector<int> a, int p = 0) {
    if (p == 5) {
        positions[idx++] = a;
        return;
    }
    
    if (p == 0 || p == 4) {
        for (int i = 0; i < 8; i++) {
            if (a[i] != -1 || (p == 0 && (i == 0 || i == 7))) continue;
            vector<int> b = a;
            b[i] = p;
            dfs(b, p + 1);
        }
    }
    
    else {
        int kp = -1;
        for (int i = 0; i < 8; i++) {
            if (a[i] == 0) kp = i;
        }
        
        for (int i = 0; i < 8; i++) {
            for (int j = i + 1; j < 8; j++) {
                if (a[i] != -1 || a[j] != -1) continue;
                vector<int> b = a;
                bool ok = 0;
                if (p == 1 && i < kp && j > kp) b[i] = b[j] = p, ok = 1;
                if (p == 2 && (i & 1) != (j & 1)) b[i] = b[j] = p, ok = 1;
                if (p == 3) b[i] = b[j] = p, ok = 1;
                if (ok) dfs(b, p + 1);
            }
        }
    }
}

int query(vector<int> a) {
    for (int i = 0; i < 8; i++) {
        cout << c[a[i]];
    }
    
    cout << endl;
    int x;
    cin >> x;
    return x;
}

int n, m, k, qq;
void solve() {
    vector<vector<int>> cand = positions;
    vector<int> test = {1, 3, 2, 4, 0, 2, 3, 1};
    while (true) {
        if (cand.size() == 1) {
            query(cand[0]);
            break;    
        }
        
        vector<int> best;
        int val = inf;
        for (auto a : positions) {
            vector<int> cnt(9);
            for (auto b : cand) {
                int x = 0;
                for (int i = 0; i < 8; i++) {
                    x += a[i] == b[i];
                }
                
                cnt[x]++;
            }
            
            int mx = 0;
            for (int i = 0; i <= 8; i++) mx = max(mx, cnt[i]);
            if (mx < val) val = mx, best = a;
        }
        
        vector<vector<int>> ncand;
        int x = query(best);
        if (x == 8) break;
        for (auto a : cand) {
            int y = 0;
            for (int i = 0; i < 8; i++) {
                y += best[i] == a[i];
            }
            
            if (x == y) ncand.push_back(a);
        }
        
        swap(cand, ncand);
    }
}

int32_t main() {
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    dfs(vector<int>(8, -1));
    string s;
    int x;
    while (true) {
        cin >> s;
        if (s == "END") break;
        cin >> x;
        solve();
    }
}