#include <bits/stdc++.h>

using i64 = long long;

int correct(std::string a, std::string b) {
    int ans = 0;
    for (int i = 0; i < 8; i++) {
        ans += (a[i] == b[i]);
    }
    return ans;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    std::string s = "RQKBBNRN";
    std::sort(s.begin(), s.end());
    
    std::vector<std::string> fig;
    do {
        bool ok = true;
        int r = 0;
        for (auto c : s) {
            if (c == 'R') {
                r++;
            }
            if (c == 'K' && r != 1) {
                ok = false;
            }
        }
        int b[2] {};
        for (int i = 0; i < 8; i++) {
            if (s[i] == 'B') {
                b[i % 2] = 1;
            }
        }
        if (!b[0] || !b[1]) {
            ok = false;
        }
        if (ok) {
            fig.push_back(s);
        }
    } while (std::next_permutation(s.begin(), s.end()));
    
    auto dfs = [&](auto self, const auto &s, int rest) -> std::pair<bool, std::map<std::vector<int>, std::string>> {
        std::map<std::vector<int>, std::string> str;
        if (s.size() <= 1) {
            if (!s.empty()) {
                str[{}] = s[0];
            }
            return {true, str};
        }
        if (rest == 0) {
            return {false, {}};
        }
        // std::cerr << s.size() << " " << rest << "\n";
        std::vector<int> cost(960);
        for (int i = 0; i < 960; i++) {
            int freq[9] {};
            for (auto &x : s) {
                freq[correct(x, fig[i])]++;
            }
            for (int j = 0; j <= 8; j++) {
                cost[i] += freq[j] * freq[j];
            }
        }
        std::vector<int> p(960);
        std::iota(p.begin(), p.end(), 0);
        std::sort(p.begin(), p.end(),
            [&](int i, int j) {
                return cost[i] < cost[j];
            });
        for (auto i : p) {
            std::vector<std::string> ns[9];
            for (auto &x : s) {
                ns[correct(x, fig[i])].push_back(x);
            }
            str.clear();
            str[{}] = {fig[i]};
            bool ok = true;
            for (int j = 0; j <= 8; j++) {
                auto [ok1, str1] = self(self, ns[j], rest - 1);
                if (!ok1) {
                    ok = false;
                    break;
                }
                for (auto [x, y] : str1) {
                    auto v = x;
                    v.insert(v.begin(), j);
                    str[v] = y;
                }
            }
            if (ok) {
                return {true, str};
            }
        }
        return {false, {}};
    };
    
    auto [ok, str] = dfs(dfs, fig, 5);
    // for (auto [x, y] : str) {
    //     std::cerr << "[";
    //     for (auto v : x) {
    //         std::cerr << v << ", ";
    //     }
    //     std::cerr << "] : " << y << "\n";
    // }
    
    while (true) {
        std::string o;
        std::cin >> o;
        
        if (o == "END") {
            break;
        }
        int num;
        std::cin >> num;
        
        std::vector<int> v;
        while (true) {
            auto s = str[v];
            std::cout << s << std::endl;
            int res;
            std::cin >> res;
            if (res == 8) {
                break;
            }
            v.push_back(res);
        }
    }
    
    return 0;
}