#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int nok = 8000;
  int siz = 888;
  vector<int> c(siz + 1);
  int val[3] = {0};
  for (int i = 0; i < 100; ++i)
  {
    cout << "? A" << endl;
    int a;
    cin >> a;
    ++c[a];
  }
  int ma = 0, mav = 0;
  for (int i = 0; i <= siz; ++i)
  {
    if (ma < c[i])
    {
      ma = c[i];
      mav = i;
    }
    c[i] = 0;
  }
  val[0] = mav;
  for (int i = 0; i < 100; ++i)
  {
    cout << "? B" << endl;
    int b;
    cin >> b;
    ++c[b];
  }
  ma = mav = 0;
  for (int i = 0; i <= siz; ++i)
  {
    if (ma < c[i])
    {
      ma = c[i];
      mav = i;
    }
    c[i] = 0;
  }
  val[1] = mav;
  string sign = "ABC";
  auto add = [&](int v1, int v2, int v3) -> void
  {
    if (nok <= 0) exit(2);
    while (nok > 0)
    {
      --nok;
      cout << "+ " << sign[v1] << ' ' << sign[v2] << ' ' << sign[v3] << endl;
      char tmp;
      cin >> tmp;
      if (tmp != '0')
      {
        while (true);
      }
      int cnt = 0;
      for (int i = 0; i < 10; ++i)
      {
        --nok;
        cout << "? " << sign[v3] << endl;
        int v;
        cin >> v;
        cnt += (v == val[v1] + val[v2]);
      }
      if (cnt >= 5) break;
    }
    val[v3] = val[v1] + val[v2];
  };
  int nowa = 0, nowb = 1, nowc = 2;
  for (int y = val[1]; y > 0; y >>= 1)
  {
    if (y & 1)
    {
      add(nowa, nowc, nowb);
      swap(nowc, nowb);
    }
    if (y > 1)
    {
      add(nowa, nowa, nowb);
      swap(nowa, nowb);
    }
  }
  cout << "! " << sign[nowc] << endl;
}