#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector<pair<string, int> >permutation;
map<char, int>check;
ll cnt[960][9], c=0;
void gen(int k, string s)
{
    if(k==8)
    {
        int pl1=0, pl2=0, pp1=0, pp2=0;
        for(int i=0; i<8; i++)
        {
            if(s[i]=='B')
            {
                if(pl1!=0)pl2=i+1;
                else pl1=i+1;
            }
            if(s[i]=='K')
            {
                if(pp1!=0 and pp2!=0)return;
                if(pp1==0 and pp2==0)return;
            }
            if(s[i]=='R')
            {
                if(pp1!=0)pp2=i+1;
                else pp1=i+1;
            }
        }
        if(pl1%2==pl2%2)return;
        permutation.push_back({s, c});
        c++;
        return;
    }
    if(check['R']<2)
    {
        check['R']++; s+='R';
        gen(k+1, s); check['R']--; s.pop_back();
    }
    if(check['B']<2)
    {
        check['B']++; s+='B';
        gen(k+1, s); check['B']--; s.pop_back();
    }
    if(check['N']<2)
    {
        check['N']++; s+='N';
        gen(k+1, s); check['N']--; s.pop_back();
    }
    if(check['K']<1)
    {
        check['K']++; s+='K';
        gen(k+1, s); check['K']--; s.pop_back();
    }
    if(check['Q']<1)
    {
        check['Q']++; s+='Q';
        gen(k+1, s); check['Q']--; s.pop_back();
    }
    return;
}

int main()
{
    string str;
    getline(cin, str);
    gen(0, "");
    for(int i=0; i<960; i++)
    {
        for(int j=i+1; j<960; j++)
        {
            int br=0;
            for(int l=0; l<8; l++)
            {
                if(permutation[i].first[l]==permutation[j].first[l])br++;
            }
            cnt[i][br]++; cnt[j][br]++;
        }
    }
    int idx=-1, mini=INT_MAX;
    for(int i=0; i<960; i++)
    {
        ll lmax=0;
        for(int j=0; j<9; j++)lmax=max(lmax, cnt[i][j]);
        if(lmax<mini){mini=lmax; idx=i;}
    }
    cout<<permutation[idx].first<<endl;
    int ans; cin>>ans;
    if(ans==8){cout<<"END"; return 0;}
    vector<pair<string, int> >smor;
    ///  ---------------------prvo------------------------ ///
    int t=2;
    while(t--)
    {for(int i=0; i<permutation.size(); i++)
    {
        int br=0;
        for(int l=0; l<8; l++)
        {
            if(permutation[i].first[l]==permutation[idx].first[l])br++;
        }
        if(br==ans)smor.push_back(permutation[i]);
    }
    idx=-1, mini=INT_MAX;
    for(int i=0; i<smor.size(); i++)
    {
        ll lmax=0;
        for(int j=0; j<9; j++)lmax=max(lmax, cnt[smor[i].second][j]);
        if(lmax<mini){mini=lmax; idx=i;}
    }
    cout<<smor[idx].first<<endl;
    permutation.clear();
    cin>>ans;
    if(ans==8){cout<<"END"; return 0;}
    for(int i=0; i<smor.size(); i++)
    {
        int br=0;
        for(int l=0; l<8; l++)
        {
            if(smor[i].first[l]==smor[idx].first[l])br++;
        }
        if(br==ans)permutation.push_back(smor[i]);
    }
    idx=-1, mini=INT_MAX;
    for(int i=0; i<permutation.size(); i++)
    {
        ll lmax=0;
        for(int j=0; j<9; j++)lmax=max(lmax, cnt[permutation[i].second][j]);
        if(lmax<mini){mini=lmax; idx=i;}
    }
    cout<<permutation[idx].first<<endl;
    smor.clear();
    cin>>ans;
    if(ans==8){cout<<"END"; return 0;}
}
    for(int i=0; i<permutation.size(); i++)
    {
        int br=0;
        for(int l=0; l<8; l++)
        {
            if(permutation[i].first[l]==permutation[idx].first[l])br++;
        }
        if(br==ans)smor.push_back(permutation[i]);
    }
    idx=-1, mini=INT_MAX;
    for(int i=0; i<smor.size(); i++)
    {
        ll lmax=0;
        for(int j=0; j<9; j++)lmax=max(lmax, cnt[smor[i].second][j]);
        if(lmax<mini){mini=lmax; idx=i;}
    }
    cout<<smor[idx].first<<endl;
    permutation.clear();
    cin>>ans;
    if(ans==8){cout<<"END"; return 0;}
    return 0;
}