#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

vector<string> v = {
        "NNRKR",
        "NRNKR",
        "NRKNR",
        "NRKRN",
        "RNNKR",
        "RNKNR",
        "RNKRN",
        "RKNNR",
        "RKNRN",
        "RKRNN"
};

vector<string> fi;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 8; i += 2) {
        for (int j = 1; j < 8; j += 2) {
            for (int k = 0; k < 6; ++k) {
                for (int l = 0; l < v.size(); ++l) {
                    string s(8, '.');
                    s[i] = s[j] = 'B';
                    int idx = 0;
                    for (int m = 0; m < 8; ++m) {
                        if (s[m] == '.') {
                            if (idx == k) {
                                s[m] = 'Q';
                            }
                            idx += 1;
                        }
                    }
                    idx = 0;
                    for (int m = 0; m < 8; ++m) {
                        if (s[m] == '.') {
                            s[m] = v[l][idx];
                            idx += 1;
                        }
                    }
                    fi.push_back(s);
                }
            }
        }
    }

    auto check = [](string s,string t) -> int {
        int res = 0;
        for (int i = 0; i < 8; ++i) {
            res += (s[i] == t[i]);
        }
        return res;
    };

    auto query = [](string s, int id = -1) -> int {
        int v = 0;
        if (id == -1) cin >> v;
        else {
            for (int i = 0; i < 8; ++i) {
                v += (s[i] == fi[id][i]);
            }
        }
        return v;
    };

    vector<vector<string>> base(9);
    for (int i = 0; i < fi.size(); ++i) {
        base[check(fi[341], fi[i])].push_back(fi[i]);
    }

    while (1) {
        string s; cin >> s;
        if (s == "END") break;
        cin >> s;
        
        cout << fi[341] << endl;
        int r = query(fi[341]);
        if (r == 8) continue;
        auto kouho = base[r];

        while (1) {
            int mx = 960;
            int opt = -1;
            vector<vector<string>> opt_cnt;
            for (int i = 0; i < fi.size(); ++i) {
                vector<vector<string>> cnt(9);
                for (auto j : kouho) {
                    cnt[check(fi[i], j)].push_back(j);
                }
                int u = 0;
                for (int j = 0; j < 9; ++j) {
                    if (cnt[j].size() > cnt[u].size()) u = j;
                }
                if (mx > cnt[u].size()) {
                    mx = cnt[u].size();
                    opt = i;
                    opt_cnt = cnt;
                }
            }
            cout << fi[opt] << endl;
            int rui = query(fi[opt]);
            kouho = opt_cnt[rui];
            if (rui == 8) break;
            if (kouho.size() == 1) {
                cout << kouho[0] << endl;
                rui = query(kouho[0]);
                if (rui == 8) break;
            }
        }
    }
}