#include <bits/stdc++.h>
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
// const int MOD = 1000000007;

template <typename T>
void __print__(std::ostream &os, const char *, const char *tail, const T &fst) {
    os << fst << tail;
}
template <typename Fst, typename... Rst>
void __print__(std::ostream &os, const char *del, const char *tail, const Fst &fst,
               const Rst &... rst) {
    os << fst << del;
    __print__(os, del, tail, rst...);
}

#ifdef LOCAL
#define dump(...)                                         \
    do {                                                  \
        std::ostringstream os;                            \
        os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
        __print__(os, ", ", "\n", __VA_ARGS__);           \
        std::cerr << os.str();                            \
    } while (0)
#else
#define dump(...)
#endif

template <typename Fst, typename... Rst>
void println(const Fst &fst, const Rst &... rst) {
    __print__(std::cout, "\n", "\n", fst, rst...);
}
template <typename Fst, typename... Rst>
void print(const Fst &fst, const Rst &... rst) {
    __print__(std::cout, " ", "\n", fst, rst...);
}

template <typename iter>
void println_(iter bgn, iter end) {
    while (bgn != end) println(*bgn++);
}

template <typename iter>
void print_(iter bgn, iter end) {
    while (bgn != end) {
        std::cout << *bgn++;
        std::cout << (bgn == end ? "\n" : " ");
    }
}

// int _ = (std::cout.precision(10), std::cout.setf(std::ios::fixed), std::cin.tie(0),
//          std::ios::sync_with_stdio(0), 0);

template <typename T>
std::vector<T> ndarray(int n, T v) {
    return std::vector<T>(n, v);
}
template <typename... Args>
auto ndarray(int n, Args... args) {
    auto val = ndarray(args...);
    return std::vector<decltype(val)>(n, move(val));
}

template <typename T>
bool umax(T &a, const T &b) {
    return a < b ? a = b, true : false;
}

template <typename T>
bool umin(T &a, const T &b) {
    return a > b ? a = b, true : false;
}

using namespace std;

int N = 999;

string check(int n) {
    string res;
    res += (n <= N && to_string(n) <= to_string(N)) ? 'Y' : 'N';
    res += (n >  N && to_string(n) >  to_string(N)) ? 'Y' : 'N';
    return res;
}

bool ask(int n) {
#ifdef LOCAL
    string s = check(n);
    dump(n, N, s);
    return s[0] == 'Y' || s[1] == 'Y';
#else
    cout << "? " << n << endl;
    string s;
    cin >> s;
    return tolower(s[0]) == 'y';
#endif
}

void ans(int n) {
    dump(n, N);
#ifdef LOCAL
    assert(n == N);
#else
    cout << "! " << n << endl;
#endif
}

void solve() {
    if (ask(1e18)) {
        rep(i, 10) {
            int n = pow(10, i+1) - 1;
            if (ask(n)) {
                ans((n+1) / 10);
                return;
            }
        }
    } else {
        ll top;
        for (top = 1; top <= (ll)1e10; top *= 10) {
            if (!ask(top)) break;
        }
        top /= 10;
        dump(top);
        ll l = top;
        ll r = top*10;
        while (l + 1 < r) {
            ll m = (l + r) / 2;
            if (ask(m*10)) {
                r = m;
            } else {
                l = m;
            }
        }
        ans(r);
    }
}

signed main() {
#ifdef LOCAL
    N = 101;
    solve();
    N = 999;
    solve();
    N = 123;
    solve();
    N = 100;
    solve();
#else
    solve();
#endif
}


Measured memory_bytes: 656