#include <bits/stdc++.h>
using namespace std;

void prepare() {
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    vector<bool> bye(50);
    uint64_t ans = 0;
    int cnt = 0;
    for (int i = 0; i < 50; ++i) {
      if (bye[i])
        continue;

      int res = i;
      for (int j = i + 1; j < 50; ++j) {
        if (s[j] == s[i]) {
          res = j;
          break;
        }
      }
      bye[res] = true;
      ans = ans * 50 + res;

      if (++cnt == 8)
        break;
    }
    cout << bitset<50>(ans) << '\n';
    cout.flush();
  }
}

vector<int> gao(bitset<50> s) {
  uint64_t b = s.to_ulong();
  vector<int> res;
  while (b) {
    res.push_back(b % 50);
    b /= 50;
  }
  reverse(res.begin(), res.end());
  return res;
}

int ask(int p) {
  cout << p + 1 << '\n';
  cout.flush();
  string ret;
  cin >> ret;
  if (ret == "##")
    exit(0);
  return ret[0] - 'A';
}

void play() {
  int t;
  cin >> t;
  while (t--) {
    bitset<50> s;
    cin >> s;
    int p = 0;
    auto ans = gao(s);
    assert(ans.size() == 8);
    vector<bool> bye(50);
    for (int i = 0; i < 50; ++i) {
      if (bye[i])
        continue;
      bye[i] = true;
      bye[ans[p]] = true;
      ask(i);
      ask(ans[p]);
      p += 1;
      if (p == ans.size())
        break;
    }

    mt19937 rnd(7122);
    auto choose_one = [&] {
      vector<int> pos;
      for (int i = 0; i < 50; ++i) {
        if (not bye[i])
          pos.push_back(i);
      }
      uniform_int_distribution<int> rng(0, pos.size() - 1);
      return pos[rng(rnd)];
    };

    queue<pair<int, int>> owo;

    int left = 17;

    array<int, 25> place;
    fill(place.begin(), place.end(), -1);
    while (left > 0) {
      if (not owo.empty()) {
        left -= 1;
        auto [i, j] = owo.front();
        owo.pop();
        ask(i);
        ask(j);
        continue;
      }

      int i = choose_one();
      int o = ask(i);
      bye[i] = true;
      if (place[o] != -1) {
        ask(place[o]);
        left -= 1;
      } else {
        place[o] = i;
        int j = choose_one();
        int r = ask(j);
        bye[j] = true;
        if (place[r] == -1) {
          place[r] = j;
        } else if (o == r) {
          left -= 1;
        } else {
          owo.emplace(place[r], j);
        }
      }
    }
  }
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  string s;
  cin >> s;
  if (s == "play") {
    play();
  } else {
    prepare();
  }
  return 0;
}