/*Bismillahir Rahmanir Rahim*///{
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long; using ld = long double;
const ll llinf = (1ll<<61)-1;
const double eps = 1e-6, ldeps = 1e-9;
struct Dbg {
static constexpr auto &os = cerr;   // replace by cerr in interactive.
template<class C> static auto dud(C *x)->decltype(os << *x, 0);
template<class C> static char dud(...);
template<class C> typename enable_if<sizeof dud<C>(0)!=1, Dbg&>::type operator<<(const C &x) { os << x; return *this; }
template<class C> Dbg &dump(C b, C e) {
    *this << "\n[";
    int cur = 0;
    for (C i = b; i!=e and cur<26; i++, cur++) *this << ", "+2*(i==b) << *i;
    return *this << ']';
}
template<class C> typename enable_if<sizeof dud<C>(0)==1, Dbg&>::type operator<<(const C &x) {
    return dump(begin(x), end(x));
}
template<class C, size_t X> typename enable_if<sizeof(C)!=1, Dbg&>::type operator <<(C (&x)[X]) {
    return dump(begin(x), end(x));
}
template<class B, class C> Dbg &operator <<(const pair<B, C> &x) {
    return *this << '{' << x.first << ", " << x.second << '}';
}
template<class C, size_t Y> struct TP {
    void operator()(Dbg& os, const C &t) { TP<C, Y-1>()(os, t); os << ", " << get<Y-1>(t); }
};
template<class C> struct TP<C, 1> { void operator()(Dbg& os, const C &t) { os << get<0>(t); } };
template<class... C> Dbg& operator<<(const tuple<C...> &t) {
    os << '{', TP<decltype(t), sizeof...(C)>()(*this, t); return *this << '}';
}
Dbg &operator<<(ostream&(*x)(std::ostream&)) { os << x; return *this; }
} dbg;
void err(istringstream *iss) { delete iss; }
template<class C, class... Args> void err(istringstream *iss, const C &val, const Args &... args) {
    string name; *iss >> name; if (name.back()==',') name.pop_back();
    dbg << name << " = " << val << "; ", err(iss, args ...);
}
#define bug(args...) dbg << __LINE__ << ": ", err(new istringstream(string(#args)), args), dbg << endl
#define sl(a) int(strlen(a))
#define sz(a) int(a.size())
int T, Q, cn;//}
const int inf = 1000000007, mxn = -1;

bool ask(string n) { cout << "? " << n << endl; char ch; cin >> ch; return ch=='Y'; }
void answer(int n) { cout << "! " << n << endl; exit(0); }

signed main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.precision(11);
/*
We can easily create n which is surely greater than N, using which we can check whether str(n)<=str(N).
If str(N)>=str(199999999999) and str(N)<str(299999999999), we can guarantee that first digit of n is 2.
 ==> We can retrieve digits from left to right. How to realize we have retrieved all the digits? For that:
If we have received 999, then we can ask 1000, otherwise we can ask 999.
*/
    string n = "199999999999";
    ll N = 0, os = 0;
    bool allNine = 1;
    for (int i = 0; i < 10; i++) {
        int lo = i==0, hi = 9, ans;
        while (lo<=hi) {
            auto mid = (lo+hi)>>1;
            n[i] = mid+'0';
            if (ask(n)) hi = mid-1, ans = mid;
            else lo = mid+1;
        }
        n[i] = ans+'0';
        N = N*10+ans, os = os*10+9;
        allNine &= ans==9;
        if ((allNine and !ask(to_string(N+1))) or (!allNine and ask(to_string(os)))) break;
    }
    answer(N);
}

Measured memory_bytes: 596