#include <algorithm>
#include <iostream>
#include <set>
#include <vector>

using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
#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()
#define smx(a, b) a = max(a, b);
#define smn(a, b) a = min(a, b);
#define pb push_back
//#define endl '\n'

const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;

bool check(string x) {
  int b1 = -1;
  int b2 = -1;
  int r = 0;
  for (int i = 0; i < 9; i++) {
    if (x[i] == 'R')
      r++;
    if (x[i] == 'K') {
      if (r != 1)
        return false;
    }
    if (x[i] == 'B') {
      if (b1 == -1) {
        b1 = i % 2;
      } else {
        b2 = i % 2;
      }
    }
  }
  if (b1 == b2)
    return false;
  return true;
}

vector<string> poss;
string currtar;

int match(string s, string t) {
  int c = 0;
  for (int i = 0; i < 8; i++)
    if (s[i] == t[i])
      c++;
  return c;
}

int maxans = 0;

void play(vector<pair<string, int>> curr, vector<string> &cposs) {
  if (cposs.size() == 1) {
    cout << cposs[0] << endl;
    int res;
    cin >> res;
    return;
  }
  string bests = "";
  int maxv = 1e9;
  for (auto s : poss) {

    vi cnts(9);
    for (auto t : cposs) {
      cnts[match(s, t)]++;
    }

    // for (auto x : cnts)
    //   cout << x << " ";
    // cout << endl;

    if (*max_element(all(cnts)) < maxv) {
      maxv = *max_element(all(cnts));
      bests = s;
    }
  }
  cout << bests << endl;
  int res;
  cin >> res;

  if (res == 8) {
    return;
  }

  curr.pb({bests, res});
  vector<string> nposs;
  for (auto t : cposs) {
    bool good = true;
    for (auto s : curr) {
      if (match(s.first, t) != s.second)
        good = false;
    }
    if (good)
      nposs.pb(t);
  }
  // cout << nposs.size() << endl;

  play(curr, nposs);
}

int main() {
  // cin.tie(0)->sync_with_stdio(0);

  string x = "BBKNNQRR";
  set<string> pset;
  int cnt = 0;
  do {
    if (check(x)) {
      pset.insert(x);
    }
    cnt++;
  } while (next_permutation(all(x)));

  for (auto s : pset)
    poss.pb(s);
  // cout << pset.size() << endl;

  string game = "";
  for (int i = 0; i < 100; i++) {
    cin >> game;

    if (game == "END")
      return 0;
    int t;
    cin >> t;
    vector<string> cposs = poss;
    play({}, cposs);
  }
  // int ctr = 0;
  // for (auto x : poss) {
  //   currtar = x;
  //   vector<string> cposs = poss;
  //   play({}, cposs);
  //   cout << ctr++ << endl;
  // }
  // cout << maxans << endl;
}