#include <bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, M = 4e6 + 10;
vector<string> tot;
void init(){
    string s = "KQRRBBNN";
    sort(s.begin(), s.end());
    do{
       int r1 = -1, r2 = -1, k = -1, b1 = -1, b2 = -1;
       for(int i = 0; i < 8; i++){
            if(s[i] == 'R'){
                if(r1 == -1) r1 = i;
                else r2 = i;
            }
            else if(s[i] == 'K') k = i;
            else if(s[i] == 'B'){
                if(b1 == -1) b1 = i;
                else b2 = i;
            }
       }
       if(r1 < k && k < r2 && ((b1 + b2) % 2 == 1)) tot.eb(s);
    }while(next_permutation(s.begin(), s.end()));
}
string ans;
int query(string t){
    cout << t << '\n';
    int res = 0;
/*
    for(int i = 0; i < 8; i++){
        if(ans[i] == t[i]) res++;
    }
*/
    cin >> res;
    return res;
}
int cal(string s, string t){
    int sum = 0;
    for(int i = 0; i < 8; i++){
        if(s[i] == t[i]) sum++;
    }
    return sum;
}
int num;
    int T = 1;
void solve(){
    vector<string> v, tmp;
    for(string t : tot) v.eb(t);
    int cnt = 0, res = 0;
    while(v.size()){
        cnt++;
        int mn = INF, id = 0;
        for(int i = 0; i < v.size(); i++){
            int mx = 0, c[9] = {0};
            for(int j = 0; j < v.size(); j++){
                c[cal(v[i], v[j])]++;
            }
            for(int j = 0; j <= 8; j++){
                mx = max(mx, c[j]);
            }
            if(mx <= mn) mn = mx, id = i;
        }
        string s = v[id];
        if(T == 2 && cnt == 2 && res == 1) s = "BBRNQKNR";
        res = query(s);
        if(res == 8) break;
        tmp.clear();
        for(string t:v){
            if(cal(s, t) == res) tmp.eb(t);
        }
        swap(v, tmp);
    }
    if(cnt > 6){
        cout << num << " " << cnt << '\n';
        cout << ans << '\n';
        return;
    }
}
signed main(){
    //ios::sync_with_stdio(false);
    //cin.tie(0), cout.tie(0);
    init();
    //ans = tot[51];
    //solve();
    //for(int i = 0; i < tot.size(); i++) ans = tot[i], ++num, solve();
    //return 0;
    string t;
    while(cin >> t){
        if(t == "END") break;
        cin >> T;
        solve();
    }
    return 0;
}