#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

string gen(ll val) {
  ll orig = val;
  string ret = "";
  for(int i = 0; i < 50; i++) {
    if(val%2) ret += "1";
    else ret += "0";
    val /= 2;
  }
  reverse(all(ret));
  return ret;
}
ll gen(string s) {
  ll ret = 0;
  for(auto out: s) {
    ret *= 2;
    ret += out == '1';
  }
  return ret;
}
void rplay() {
  string s;
  cin >> s;
  vector<int> offsets;
  int denom = 35;
  ll base = gen(s);
  while(sz(offsets) < 9) {
    offsets.pb(base % denom);
    base /= denom;
    denom += 2;
  }
  reverse(all(offsets));
  int paired = 0;
  vector<bool> flipped(50);
  for(int i = 0; i < 9; i++) {
    int j = 0;
    while(flipped[j]) j++;
    cout << (j+1) << endl;
    flipped[j] = true;
    string a;
    cin >> a;
    int x = j+1;
    int need = offsets[i];
    string b;
    while(true) {
      if(flipped[x]) {
        x++;
        continue;
      }
      if(need == 0) {
        cout << (x+1) << endl;
        cin >> b;
        flipped[x] = true;
        break;
      }
      else {
        need--;
        x++;
      }
    } 
    if(a[0] != b[0]) while(true);
    paired++;
  }
  map<char, set<int>> seen; // zero indexed
  while(paired < 25) {
    char known = -1;
    for(auto [k, v]: seen) {
      if(sz(v) == 2) {
        known = k;
        break;
      }
    }
    if(known >= 'A' && known <= 'Y') {
      cout << (*seen[known].begin())+1 << endl;
      string a;
      cin >> a;
      if(a == "##") while(true);
      cout << (*seen[known].rbegin())+1 << endl;
      string b;
      cin >> b;
      if(b == "##") while(true);
      if(a[0] != b[0]) while(true);
      paired++;
      flipped[(*seen[known].begin())] = true;
      flipped[(*seen[known].rbegin())] = true;
      seen.erase(known);
    }
    int i = 0;
    while(flipped[i]) i++;
    flipped[i] = true;
    cout << (i+1) << endl;
    string a; cin >> a;
    if(a == "##") while(true);
    if(seen.count(a[0]) && *(seen[a[0]].begin()) != i) {
      cout << *(seen[a[0]].begin())+1 << endl;
      string b;
      cin >> b;
      if(b == "##") while(true);
      if(a[0] != b[0]) while(true);
      seen.erase(a[0]);
      paired++;
    }
    else {
      seen[a[0]].insert(i);
      i++;
      while(flipped[i]) i++;
      flipped[i] = true;
      cout << (i+1) << endl;
      string b; cin >> b;
      if(b == "##") while(true);
      if(b[1] == '+' || b[1] == '!') {
        seen.erase(b[0]);
        paired++;
      }
      else seen[b[0]].insert(i);
    }
  }
}
void play() {
  int t;
  cin >> t;
  while(t--) rplay();
}
void prepare() {
  int t;
  cin >> t;
  while(t--) {
    string s;
    cin >> s;
    ll val = 0;
    int amt = 49;
    set<char> seen;
    for(int i = 0; i < sz(s) && sz(seen) < 9; i++) {
      if(seen.count(s[i])) continue;
      if(i) {
        val *= amt;
        amt -= 2;
      }
      int j = sz(s)-1;
      while(s[j] != s[i]) j--;
      int inc = 0;
      for(int k = i+1; k < j; k++) {
        if(!seen.count(s[k])) inc++;
      }
      val += (inc);
      seen.insert(s[i]);
    }
    string ret = gen(val);
    cout << ret << endl;
    assert(gen(gen(ret)) == ret);
  }
}
void solve() {
  string s;
  cin >> s;
  if(s == "prepare") prepare();
  else {
    assert(s == "play");
    play();
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}