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

using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, l, r) for(ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b) { return a < b ? a = b, 1 : 0; }

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) { cout << x << endl; }

template<class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

ll extgcd(ll a, ll b, ll &x, ll &y) {
  // assert(a >= 0 && b >= 0);
  if(!b) return x = 1, y = 0, a;
  ll d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

ll inv_mod(ll x, ll m) {
  ll y, z;
  extgcd(x, m, y, z);
  return (y % m + m) % m;
}

pair<ll, ll> crt(vll r, vll m) {
  int n = r.size();
  ll r0 = 0, m0 = 1;
  rep(i, n) {
    ll g, im, x;
    g = extgcd(m0, m[i], im, x);
    if((r[i] - r0) % g) return {-1, -1};
    ll tmp = (r[i] - r0) / g * im % (m[i] / g);
    r0 += m0 * tmp;
    m0 *= m[i] / g;
  }
  return {(r0 % m0 + m0) % m0, m0};
}

using i128 = __int128_t;
template<class T, class U>
T pow_mod(T x, U n, T m) {
  T r = 1 % m;
  x %= m;
  while(n) {
    if(n & 1) r = (r * x) % m;
    x = (x * x) % m;
    n >>= 1;
  }
  return r;
}

bool is_prime(ll n) {
  if(n <= 1) return false;
  if(n == 2) return true;
  if(n % 2 == 0) return false;
  ll d = n - 1;
  while(d % 2 == 0) d /= 2;
  vll a_list = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
  // vll a_list;
  // if (n < (1 << 30)) {
  //   a_list = {2, 7, 61};
  // } else {
  //   a_list = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  // }
  for(auto a : a_list) {
    if(n <= a) break;
    ll t = d;
    ll y = pow_mod<i128>(a, t, n);
    while(t != n - 1 && y != 1 && y != n - 1) {
      y = i128(y) * y % n;
      t <<= 1;
    }
    if(y != n - 1 && t % 2 == 0) return false;
  }
  return true;
}

mt19937_64 rng(2024); // [0, 2^64)
ll randint(ll l, ll r) { return l + rng() % (r - l + 1); }

int LOCAL=0;
ll X;

ll ask_cnt=0;

ll MAX=1000000000000000000LL;
bool ask(ll Y){
  ask_cnt++;
  assert(Y<=MAX);
  if(LOCAL){
    if(is_prime(X+Y))return true;
    return false;
  }
  cout<<"? "<<Y<<endl;
  string res;
  cin>>res;
  if(res[0]=='C')return false;
  else return true;
}


vi Ps={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 41, 43, 47, 53};
// vi Ps={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 101};
void solve(){
  ask_cnt=0;
  if(LOCAL)X=randint(1,MAX);
  vector<set<int>>ng(110);
  while(true){
    bool flag=true;
    for(auto p:Ps){
      if(ng[p].size()!=p-1){
        flag=false;
      }
    }
    if(flag){
      ll mod=1;
      ll rem=0;
      for(auto p:Ps){
        rep(i,p){
          if(ng[p].find(i)==ng[p].end()){
            ll j=(p-i)%p;
            auto [r,m]=crt({rem,j},{mod,p});
            mod=m;
            rem=r;
          }
        }
      }
      if(LOCAL){
        assert(rem==X);
      }
      cout<<"! "<<rem<<endl;
      string res;
      cin>>res;
      assert(res=="Correct");
      return;
    }
    ll ask_mod=1;
    ll ask_rem=0;
    for(auto p:Ps){
      ll nr;
      while(true){
        nr=randint(0,p-1);
        if(ng[p].find(nr)==ng[p].end()){
          if(ng[p].size()!=p-1)break;
        }
        else{
          if(ng[p].size()==p-1)break;
        }
      }
      auto [r,m]=crt({ask_rem,nr},{ask_mod,p});
      ask_mod=m;
      ask_rem=r;
    }
    if(ask_rem>MAX)continue;
    ll LIM=(MAX-ask_rem)/ask_mod;
    ll Y=ask_mod*randint(0,LIM)+ask_rem;
    assert(Y<=MAX);
    if(ask(Y)){
      for(auto p:Ps){
        ng[p].insert(Y%p);
      }
    }
  }
}

int main(){
  int T;
  cin>>T;
  rep(i,T){
    solve();
  }
}