#include<bits/stdc++.h>
using namespace std;
string tmp,st[1000],bf;
int cnt=0,id;
int same(int x,int y) {
    int res=0;
    for (int i=0;i<8;i++) if (st[x][i]==st[y][i]) res++;
    return res;
}
vector<int> vec[2];
int sres[1000][1000];
int calcmax() {
    int calc[9]={0,0,0,0,0,0,0,0,0},res=0;
    int minx=cnt,miny=0;
    for (int j=0;j<vec[0].size();j++) {
        int curx=vec[0][j];
        memset(calc,0,sizeof(calc));
        for (auto cury:vec[0]) calc[sres[curx][cury]]++;
        res=0;
        for (int i=0;i<9;i++) res=max(res,calc[i]);
        if (res<=minx) {
            minx=res;
            miny=curx;
        }
    }
    return miny;
}
int queri(int x) {
    int y=0;
    cout<<st[x]<<endl;
    cin>>y;
    return y;
}
void solve() {
    vec[0].clear();vec[1].clear();
    for (int i=1;i<=960;i++) vec[0].push_back(i);
    int cur=0,tmpx=0;
    while (1) {
        cur++;
        tmpx=calcmax();
        int x=queri(tmpx);
        if (x==8) return;
        for (auto cur:vec[0]) {
            if (sres[tmpx][cur]==x) vec[1].push_back(cur);
        }
        vec[0].clear();
        for (auto cur:vec[1]) vec[0].push_back(cur);
        vec[1].clear();
    }
}
int main() {
    for (int i=0;i<8;i++) {
        for (int j=i+1;j<8;j++) {
            for (int k=j+1;k<8;k++) {
                for (int x=0;x<7;x+=2) {
                    if ((x==i)||(x==j)||(x==k)) continue;
                    for (int y=1;y<8;y+=2) {
                        if ((y==i)||(y==j)||(y==k)) continue;
                        for (int z=0;z<8;z++) {
                            if ((z==i)||(z==j)||(z==k)||(z==x)||(z==y)) continue;
                            tmp="NNNNNNNN";
                            tmp[i]=tmp[k]='R';
                            tmp[j]='K';
                            tmp[x]=tmp[y]='B';
                            tmp[z]='Q';
                            st[++cnt]=tmp;
                        }
                    }
                }
            }
        }
    }
    mt19937 sf(11);
    shuffle(st+1,st+1+cnt,sf);
    for (int i=1;i<=cnt;i++) {
        for (int j=1;j<=cnt;j++) sres[i][j]=same(i,j);
    }
    cin>>bf;
    while (bf!="END") {
        cin>>id;
        solve();
        cin>>bf;
    }
    return 0;
}