#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rp(i,a,b)        for(int i=a;i<b;i++)

vector<string> resp;

// Function to verify if the string is valid based on the problem constraints
bool veri(string &t) {
    int te = -1;
    rp(i, 0, 8) {
        if(te >= 0 && t[i] == 'B' && (i % 2) == (te % 2)) 
            return false;
        else if(t[i] == 'B') 
            te = i;
    }
    rp(i, 0, 8) {
        if(t[i] == 'K') {
            bool flag1 = true, flag2 = true;
            rp(j, 0, i) if(t[j] == 'R') flag1 = false;
            rp(j, i, 8) if(t[j] == 'R') flag2 = false;
            if(flag1 || flag2) return false;
            break;
        }
    }
    return true;
}

void solvetask() {
    int n;
    cin >> n;
    vector<string> current_state = resp; 
    string best_guess;

    for(int turn = 0; turn < 10; ++turn) {
        int max_reduction = 0;
        string selected_guess;
        
        for (auto &guess : current_state) {
            vector<int> bins(9, 0); 
            
            for (auto &candidate : current_state) {
                int matches = 0;
                for (int k = 0; k < 8; ++k) 
                    if (guess[k] == candidate[k]) 
                        ++matches;
                bins[matches]++;
            }
            
            int largest_bin = *max_element(bins.begin(), bins.end());
            if (largest_bin < max_reduction || max_reduction == 0) {
                max_reduction = largest_bin;
                selected_guess = guess;
            }
        }

        cout << selected_guess << endl;
        fflush(stdout);

        int correct_positions;
        cin >> correct_positions; 

        if (correct_positions == 8) 
            break;

        vector<string> new_state;
        for (auto &candidate : current_state) {
            int matches = 0;
            for (int k = 0; k < 8; ++k)
                if (candidate[k] == selected_guess[k])
                    ++matches;
            if (matches == correct_positions)
                new_state.push_back(candidate);
        }
        
        current_state = new_state; 
    }
}

void pre_cal() {
    string temp = "BBQKNNRR";
    sort(temp.begin(), temp.end());
    do {
        if(veri(temp)) 
            resp.push_back(temp);
    } while(next_permutation(temp.begin(), temp.end()));
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    string t;
    pre_cal();

    while (true) {
        cin >> t;
        if (t == "END") 
            return 0; 
        solvetask();
    }
}