#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    const int X = 10;
    auto get_num = [&](char c) -> int {
        map<int, int> m;
        while (true){
            cout << "? " << c << endl;
            int res;
            cin >> res;
            m[res]++;
            if (m[res] == X) return res;
        }
    };
    int x = get_num('A');
    int y = get_num('B');
    char ans = 'C';
    char rem = 'B';
    char A = 'A';
    int ex = 0;
    rep(rp, 0, 10){
        if (y & (1 << rp)){
            ex += x;
            while (true){
                cout << "+ " << A << " " << ans << " " << rem << endl;
                int z;
                cin >> z;
                if (get_num(rem) == ex) break;
            }
            swap(ans, rem);
        }
        // rem を 2A にする
        x *= 2;
        while (true){
            cout << "+ " << A << " " << A << " " << rem << endl;
            int z;
            cin >> z;
            if (get_num(rem) == x) break;
        }
        swap(A, rem);
    }
    cout << "! " << ans << endl;
}

/*
 * 20 回くらい聞いて、最頻値を取れば、値は正確に取得できそう
 * A, 2A, 4A ... を頑張ってたす
 */