#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
using namespace std;

vector<string> Iper;

#define LOG(f...) fprintf(stderr, f)

void solve(vector<string> per, int depth = 1) {
  if (per.size() == 1) {
    printf("%s\n", per[0].c_str());
    fflush(stdout);
    scanf("%*d");
    return;
  }
  vector<vector<string>> optimal;
  string que;
  int mn = 961;
  for (string s : Iper) {
    vector<vector<string>> mat(9);
    for (string t : per) {
      int cnt = 0;
      for (int j = 0; j < 8; ++j)
        cnt += s[j] == t[j];
      mat[cnt].push_back(t);
    }
    int mx = 0;
    for (int i = 0; i < 9; ++i)
      mx = max(mx, (int)mat[i].size());
    if (mx < mn) mn = mx, optimal = mat, que = s;
  }
  printf("%s\n", que.c_str());
  fflush(stdout);
  int num;
  scanf("%d", &num);
  if (num != 8) solve(optimal[num], depth + 1);
}

int main() {
  string s = "BBKNNQRR";
  vector<string> per;
  int ans = 0;
  do {
    bool tag = true;
    int p0 = -1, p1 = -1;
    for(int i = 0; i < 8; i++) {
      if(s[i] == 'B') {
        if(p0 != -1) p1 = i;
        else p0 = i;
      }
    }
    tag &= (p0 % 2) != (p1 % 2);
    p0 = p1 = -1;
    int p = -1;
    for(int i = 0; i < 8; i++) {
      if(s[i] == 'R') {
        if(p0 != -1) p1 = i;
        else p0 = i;
      }
      if(s[i] == 'K') {
        p = i;
      }
    }
    tag &= (p0 <= p && p <= p1);
    ans += tag;
    if (tag) per.push_back(s);
  } while(next_permutation(s.begin(), s.end()));
  Iper = per;
  while (true) {
    char s[100];
    scanf("%s%*d", s);
    if (*s == 'G') solve(per);
    else return 0;
  }
}