#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int check(char c) {
    map<int, int> cnt;
    rep(i, 80) {
        cout << "? " << c << endl;
        int res;
        cin >> res;
        cnt[res]++;
    }
    int mxi = -1, mxv = 0;
    for(auto[i, v]: cnt) if(chmax(mxv, v)) mxi = i;
    return mxi;
}

void add(char v1, char v2, char v3, int res) {
    while(1) {
        cout << "+ " << v1 << " " << v2 << " " << v3 << endl;
        if(check(v3) == res) break;
    }
}

char make(int y, int x) {
    if(y == 1) {
        add('A', 'C', 'B', x);
        return 'B';
    }
    char v = make(y/2, x);
    add(v, v, v^'B'^'C', x*(y/2*2));
    if(y&1) {
        add(v^'B'^'C', 'A', v, x * y);
        return v;
    }
    return v^'B'^'C';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int x = check('A');
    int y = check('B');
    char v = make(y, x);
    cout << "! " << v << endl;
    return 0;
}