#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int n = 8 ;
vector < string > s ;

bool ok ( string a ) {
    int r1 = -1 , r2 = -1 , b1 = -1 , b2 = -1 , k = -1 ;
    int tp = 0 ;
    for ( auto c : a ) {
        if ( c == 'K' ) { k = tp ; }
        else if ( c == 'R' ) {
            if ( r1 == -1 ) { r1 = tp ; }
            else { r2 = tp ; }
        }
        else if ( c == 'B' ) {
            if ( b1 == -1 ) { b1 = tp ; }
            else { b2 = tp ; }
        }
        ++ tp ;
    }
    if ( ( b1 % 2 ) == ( b2 % 2 ) ) { return false ; }
    if ( k < r1 || r2 < k ) { return false ; }
    return true ;
}

void gen ( ) {
    string a = "KQRRBBNN" ;
    sort ( a.begin ( ) , a.end ( ) ) ;
    int tot = 0 ;
    do {
        if ( ok ( a ) == true ) { s.push_back ( a ) ; }
    } while ( next_permutation ( a.begin ( ) , a.end ( ) ) ) ;
}

const int LIM = 5007 ;

int tp = 1 ;
string opt[ LIM ] ;
int sz[ LIM ] ;
int to[ LIM ][ 10 ] ;

void calc ( int w , vector < string > rem , int dep ) {
    sz[ w ] = rem.size ( ) ;
    if ( rem.empty ( ) == true ) {
        return ;
    }
    if ( rem.size ( ) <= 1 ) {
        opt[ w ] = rem[ 0 ] ;
        return ;
    }
    pair < int , string > best = { LIM , "" } ;
    int init_val = 4 ;
    int wtf = init_val ;
    for ( auto sr : rem ) {
        int cnt[ 11 ] ;
        for ( int i = 0 ; i <= 10 ; ++ i ) { cnt[ i ] = 0 ; }
        for ( auto hh : rem ) {
            int cm = 0 ;
            for ( int i = 0 ; i < n ; ++ i ) {
                if ( hh[ i ] == sr[ i ] ) { ++ cm ; }
            }
            ++ cnt[ cm ] ;
        }
        int mx = 0 ;
        for ( int i = 0 ; i <= 10 ; ++ i ) {
            mx = max ( mx , cnt[ i ] ) ;
        }
        if ( w == 1 ) {
            -- wtf ;
            if ( wtf == 0 ) { 
                best = make_pair ( mx , sr ) ;
            }
        }
        else if ( best.fi >= mx ) {
            best = make_pair ( mx , sr ) ;
        }
    }
    opt[ w ] = best.se ;
    vector < string > nxt[ 11 ] ;
    for ( auto hh : rem ) {
        int cm = 0 ;
        for ( int i = 0 ; i < n ; ++ i ) {
            if ( hh[ i ] == opt[ w ][ i ] ) { ++ cm ; }
        }
        nxt[ cm ].push_back ( hh ) ;
    }
    for ( int i = 0 ; i <= 8 ; ++ i ) {
        to[ w ][ i ] = ++ tp ;
        calc ( to[ w ][ i ] , nxt[ i ] , dep + 1 ) ;
    }
}

string ans ;

int calc ( string sr ) {
    int cm = 0 ;
    for ( int i = 0 ; i < n ; ++ i ) {
        if ( sr[ i ] == ans[ i ] ) { ++ cm ; }
    }
    return cm ;
}

void play_game ( ) {
    int wh = 1 ;
    while ( 1 ) {
        cout << opt[ wh ] << "\n" ;
        fflush ( stdout ) ;
        // if ( cnt > 6 ) { cout << "wa " << opt[ wh ] << " " << ans << "\n" ;  }
        int ret ; cin >> ret ;
        if ( ret == 8 ) {
            break ;
        }
        else {
            wh = to[ wh ][ ret ] ;
        }
    }
}

void solve ( ) {
    gen ( ) ;
    tp = 1 ;
    calc ( 1 , s , 0 ) ;
    string foo ;
    int test_id ;
    while ( 1 ) {
        cin >> foo ;
        if ( foo[ 0 ] == 'E' ) { break ; }
        cin >> test_id ;
        play_game ( ) ;
    }
}

int main ( ) {
    // ios_base :: sync_with_stdio ( false ) ;
    // cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}