#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;

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> temp = resp;
    string compa = "BRKNNQRB";
    string at = temp[0];
    for(int a = 0; a < 10; a++){
        cout << at << endl;
        fflush (stdout);
        int iguais=0;
        cin >> iguais;
        //for(int j = 0; j < 8; j++) if(compa[j] == at[j]) iguais++;
        if(iguais == 8) return;
        vector<string> nova;
        for(int j = 0; j < temp.size(); j++){
            int comp = 0;
            if(at == temp[j]) continue;
            for(int k = 0; k < 8; k++) if(at[k] == temp[j][k]) comp++;
            if(comp == iguais) nova.push_back(temp[j]);
        }
        temp = nova;
        int atual = 0;
        for(int i = 0; i < temp.size(); i++){
            int t=1e9;
            for(int j = 0; j < temp.size(); j++){
                int comp = 0;
                for(int k = 0; k < 8; k++) if(at[k] == temp[j][k]) comp++;
                if(comp == iguais) t++;
            }
            if(t > atual){
                t = atual;
                at = temp[i];
            }
        }
        cout << atual << "\n";
    }
}

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

int main(){
    cin.tie(0)->sync_with_stdio(0);
    string t;
    pre_cal();
    while(true){
        cin >> t;
        if(t == "END") return 0;
        solvetask();
    } 
}