#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int L = 8;
int N;
vector<string> S;

vector<vector<int>> split(const vector<int> &us, int x) {
  vector<vector<int>> uss(L + 1);
  for (const int u : us) {
    int cnt = 0;
    for (int i = 0; i < L; ++i) if (S[u][i] == S[x][i]) ++cnt;
    uss[cnt].push_back(u);
  }
  return uss;
}

map<vector<int>, int> choices;
bool dfs(const vector<int> &us, int turn) {
  if (turn >= 6) {
    return false;
  }
  if (us.size() == 0) {
    assert(false);
  } else if (us.size() == 1) {
    choices[us] = us[0];
    return true;
  } else {
    vector<pair<int, int>> cands(N);
    for (int x = 0; x < N; ++x) {
      const auto uss = split(us, x);
      int cost = 0;
      for (int k = 0; k < L; ++k) chmax(cost, (int)uss[k].size());
      cands[x] = make_pair(cost, x);
    }
    sort(cands.begin(), cands.end());
    for (const auto &cand : cands) {
      const int x = cand.second;
      const auto uss = split(us, x);
      bool ok = true;
      for (int k = 0; k < L; ++k) if (!uss[k].empty()) {
        ok = ok && dfs(uss[k], turn + 1);
      }
      if (ok) {
        choices[us] = x;
        return true;
      }
cerr<<"wow "<<us<<" "<<cand<<endl;
    }
    return false;
  }
}

int Ask(int x) {
  puts(S[x].c_str());
  fflush(stdout);
  int k;
  scanf("%d", &k);
  return k;
}
int main() {
  {
    string s = "KQRRBBNN";
    sort(s.begin(), s.end());
    do {
      if ([&]() -> bool {
        string t = "";
        for (const char c : s) if (c == 'K' || c == 'R') t += c;
        if (t != "RKR") return false;
        vector<int> is;
        for (int i = 0; i < L; ++i) if (s[i] == 'B') is.push_back(i);
        if ((is[0] & 1) == (is[1] & 1)) return false;
        return true;
      }()) {
        S.push_back(s);
      }
    } while (next_permutation(s.begin(), s.end()));
  }
  N = S.size();
cerr<<"N = "<<N<<endl;
  
  vector<int> start(N);
  for (int u = 0; u < N; ++u) start[u] = u;
  const bool res = dfs(start, {});
cerr<<"|choices| = "<<choices.size()<<endl;
  assert(res);
  
  for (; ; ) {
    char buf[110];
    scanf("%s", buf);
    if (!strcmp(buf, "END")) break;
    scanf("%s", buf);
    
    auto us = start;
    for (; ; ) {
      const int x = choices[us];
      const int k = Ask(x);
      if (k == L) {
        break;
      } else {
        us = split(us, x)[k];
      }
    }
  }
  return 0;
}