#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
map<long long, int> dp;
set<int> st;
int ar[50][50];
int m, n;
string query(int a, int b) {
  string str;
  printf("? %d %d\n", a, b);
  fflush(stdout);
  cin >> str;
  return str;
}
int main() {
  while (1) {
    string act;
    cin >> act;
    if (act == "start") {
      int beg = 1;
      int end = 2;
      while (query(beg, end) == "y") {
        beg = beg << 1;
        end = end << 1;
      }
      if (beg > 1)
        while (beg < end) {
          int mid = (beg + end) / 2;
          if (query(mid, end) == "y")
            end = mid;
          else
            beg = mid + 1;
        }
      else {
        if (query(0, 1) == "y") beg = 2;
      }
      cout << "! " << beg << endl;
      fflush(stdout);
    } else {
      break;
    }
  }
  return 0;
}
