#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
  return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
  return ((a) / gcd((a), (b)) * (b));
}
template <class T>
inline T BigMod(T Base, T power, T M = 1000000007) {
  if (power == 0) return 1;
  if (power & 1)
    return ((Base % M) * (BigMod(Base, power - 1, M) % M)) % M;
  else {
    T y = BigMod(Base, power / 2, M) % M;
    return (y * y) % M;
  }
}
template <class T>
inline T ModInv(T A, T M = 1000000007) {
  return BigMod(A, M - 2, M);
}
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int ask(int x, int y) {
  cout << "? " << x << " " << y << endl;
  string s;
  cin >> s;
  if (s == "x")
    return 1;
  else
    return 0;
}
int next(int x) {
  if (x == 0)
    return 1;
  else
    return x << 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  while (1) {
    string s;
    cin >> s;
    if (s != "start") return 0;
    int num = 0;
    while (1) {
      int res = ask(num, next(num));
      if (res == 1) break;
      num = next(num);
    }
    if (next(num) == num + 1) {
      cout << "! " << num + 1 << endl;
      continue;
    }
    int low = num + 1, high = next(num), mid, ans;
    while (low <= high) {
      mid = (low + high) >> 1;
      int res = ask(num, mid);
      if (res) {
        high = mid - 1;
        ans = mid;
      } else {
        low = mid + 1;
      }
    }
    cout << "! " << low << endl;
  }
  return 0;
}
