#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}

bool valid(string s) {
  array<int, 2> posR = {-1, -1}, posB = {-1, -1};
  int posK = -1;
  for(int i = 0; i < ssize(s); i++) {
    if (s[i] == 'K')
      posK = i;
    if (s[i] == 'R')
      posR[posR[0] != -1] = i;
    if (s[i] == 'B')
      posB[posB[0] != -1] = i;
  }
  return posB[0] % 2 != posB[1] % 2 and posR[0] < posK and posK < posR[1];
}

array<string, 960> state;
array<bool, 960> cand;
int match[960][960];

int mxGroupSize(int j) {
  array<int, 9> cnt = {};
  for(int i = 0; i < 960; i++)
    if (cand[i])
      cnt[match[i][j]]++;
  return R::max(cnt);
}

signed main() {
  //ios::sync_with_stdio(false), cin.tie(NULL);

  {
    string s = "BBKNNQRR";
    int ptr = 0;
    do {
      if (valid(s))
        state[ptr++] = s;
    } while(next_permutation(s.begin(), s.end()));
  }

  for(int i = 0; i < 960; i++)
    for(int j = 0; j < 960; j++)
      for(int k = 0; k < 8; k++)
        match[i][j] += state[i][k] == state[j][k];

  string s; cin >> s;
  while(s != "END") {
    int t; cin >> t;
    fill(cand.begin(), cand.end(), true);
    bool done = false;
    int guess = 0;
    while(guess < 6 and !done) {
      guess++;
      int qs;
      int mn = INT_MAX;
      for(int i = 0; i < 960; i++)
        if (int tmp = mxGroupSize(i); tmp - cand[i] < mn)
          mn = tmp, qs = i;
      cout << state[qs] << endl;
      int res; cin >> res;
      //int res = match(qs, sol);
      for(int i = 0; i < 960; i++)
        if (cand[i])
          cand[i] = match[qs][i] == res;
      if (res == 8)
        done = true;
    }

    if (!done and guess == 6)
      return 0;

    cin >> s;
  }

  //cout << "correct!\n";

  return 0;
}