/*
 * author:  ADMathNoob
 * created: 09/13/23 10:42:01
 * problem: https://qoj.ac/problem/7179
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 960;
const int V = 3 * N;

int nodes = 0;
int sz[V];
int ask[V];
int child[V][8];

int res[N][N];

void Dfs(int x, const vector<int>& v) {
  // debug(x, v);
  sz[x] = v.size();
  if (sz[x] == 1) {
    ask[x] = v[0];
    return;
  }
  int best = v.size();
  for (int a = 0; a < N; a++) {
    vector<int> cnt(8);
    for (int i : v) {
      if (i != a) {
        cnt[res[a][i]] += 1;
      }
    }
    int mx = *max_element(cnt.begin(), cnt.end());
    if (mx < best) {
      best = mx;
      ask[x] = a;
    }
  }
  vector<vector<int>> split(8);
  for (int i : v) {
    if (i != ask[x]) {
      split[res[ask[x]][i]].push_back(i);
    }
  }
  for (int r = 0; r < 8; r++) {
    if (!split[r].empty()) {
      int c = nodes++;
      child[x][r] = c;
      Dfs(c, split[r]);
    } else {
      child[x][r] = -1;
    }
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  
  vector<string> all;
  for (int b0 = 0; b0 < 8; b0 += 2) {
    for (int b1 = 1; b1 < 8; b1 += 2) {
      for (int r0 = 0; r0 < 8; r0++) {
        for (int k = r0 + 1; k < 8; k++) {
          for (int r1 = k + 1; r1 < 8; r1++) {
            for (int q = 0; q < 8; q++) {
              set<int> p = {b0, b1, r0, k, r1, q};
              if (p.size() == 6) {
                string s(8, 'N');
                s[b0] = s[b1] = 'B';
                s[r0] = s[r1] = 'R';
                s[k] = 'K';
                s[q] = 'Q';
                all.push_back(s);
              }
            }
          }
        }
      }
    }
  }
  assert(all.size() == N);
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      int d = 0;
      for (int t = 0; t < 8; t++) {
        d += (all[i][t] == all[j][t]);
      }
      res[i][j] = d;
    }
  }
  vector<int> nums(N);
  iota(nums.begin(), nums.end(), 0);
  Dfs(nodes++, nums);
  
  while (true) {
    {
      string s;
      cin >> s;
      if (s == "END") {
        break;
      }
      assert(s == "GAME");
      cin >> s;
    }
    int v = 0;
    while (true) {
      cout << all[ask[v]] << endl;
      int r;
      cin >> r;
      if (r == 8) {
        break;
      }
      v = child[v][r];
      assert(v != -1);
    }
  }
  return 0;
}