#include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

template<::std::uint_fast64_t mod>
class ModInt{
private:
  using value_type = ::std::uint_fast64_t;
  value_type n;
public:
  ModInt() : n(0) {}
  ModInt(value_type n_) : n(n_ % mod) {}
  ModInt(const ModInt& m) : n(m.n) {}

  template<typename T>
  explicit operator T() const { return static_cast<T>(n); }
  value_type get() const { return n; }

  friend ::std::ostream& operator<<(::std::ostream &os, const ModInt<mod> &a) {
    return os << a.n;
  }

  friend ::std::istream& operator>>(::std::istream &is, ModInt<mod> &a) {
    value_type x;
    is >> x;
    a = ModInt<mod>(x);
    return is;
  }

  bool operator==(const ModInt& m) const { return n == m.n; }
  bool operator!=(const ModInt& m) const { return n != m.n; }
  ModInt& operator*=(const ModInt& m){ n = n * m.n % mod; return *this; }

  ModInt pow(value_type b) const{
    ModInt ans = 1, m = ModInt(*this);
    while(b){
      if(b & 1) ans *= m;
      m *= m;
      b >>= 1;
    }
    return ans;
  }

  ModInt inv() const { return (*this).pow(mod-2); }
  ModInt& operator+=(const ModInt& m){ n += m.n; n = (n < mod ? n : n - mod); return *this; }
  ModInt& operator-=(const ModInt& m){ n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
  ModInt& operator/=(const ModInt& m){ *this *= m.inv(); return *this; }
  ModInt operator+(const ModInt& m) const { return ModInt(*this) += m; }
  ModInt operator-(const ModInt& m) const { return ModInt(*this) -= m; }
  ModInt operator*(const ModInt& m) const { return ModInt(*this) *= m; }
  ModInt operator/(const ModInt& m) const { return ModInt(*this) /= m; }
  ModInt& operator++(){ n += 1; return *this; }
  ModInt& operator--(){ n -= 1; return *this; }
  ModInt operator++(int){
    ModInt old(n);
    n += 1;
    return old;
  }
  ModInt operator--(int){
    ModInt old(n);
    n -= 1;
    return old;
  }
  ModInt operator-() const { return ModInt(mod-n); }
};

constexpr int64 mod = 1e9+7;
using Mint = ModInt<mod>;

int64 N;

char judge(int64 n) {
  if ((n <= N) ^ (to_string(n) <= to_string(N))) {
    return 'N';
  }
  return 'Y';
}

void bin_search(string& str, int64 dig, int64 l, int64 r) {
  int64 m;
  l--;
  while (r - l > 1) {
    m = (l + r) >> 1;
    str[dig] = m + '0';
    cout << "? " << str << endl;
    char ret;
     cin >> ret;
//    ret = judge(stoll(str));
    if (ret == 'Y') {
      r = m;
    } else {
      l = m;
    }
  }
  str[dig] = l+1+'0';
}

int main(void) {
  string res = "9999999999";
//  cin >> N;
  bin_search(res, 0, 1, 9);
  FOR(i, 1, 10) {
    bin_search(res, i, 0, 9);
  }
  while (res.back() == '0') {
    string r2 = res;
    int flag = 0;
    if (r2[r2.size()-2] == '0') {
      r2.pop_back();
      if (r2.back() == '0') r2.back()++;
      else r2.back()--;
    } else {
      if (r2[r2.size()-2] == '9') {
        r2[r2.size()-2]--;
        r2.back() = '9';
        flag = 2;
      } else {
        r2.pop_back();
        r2.back()++;
        flag = 1;
      }
    }
    cout << "? " << r2 << endl;
    char ret;
     cin >> ret;
//    ret = judge(stoll(r2));
    if (ret == 'N') {
      if (flag == 1) {
        break;
      } else if (flag == 2) {
        res.pop_back();
        continue;
      }
      break;
    } else {
      if (flag == 2) {
        break;
      }
      res.pop_back();
    }
  }
  cout << "! " << res << endl;
}


Measured memory_bytes: 724