This is an interactive problem.

We have hidden an integer 1 ≤ X ≤ 10^{9}. You don't have to guess this number. You have to find the number of divisors of this number, and you don't even have to find the exact number: your answer will be considered correct if its absolute error is not greater than 7 or its relative error is not greater than 0.5. More formally, let your answer be ans and the number of divisors of X be d, then your answer will be considered correct if at least one of the two following conditions is true:

  * | ans - d | ≤ 7;
  * 1/2 ≤ ans/d ≤ 2.



You can make at most 22 queries. One query consists of one integer 1 ≤ Q ≤ 10^{18}. In response, you will get gcd(X, Q) — the greatest common divisor of X and Q.

The number X is fixed before all queries. In other words, interactor is not adaptive.

Let's call the process of guessing the number of divisors of number X a game. In one test you will have to play T independent games, that is, guess the number of divisors T times for T independent values of X.

Input

The first line of input contains one integer T (1 ≤ T ≤ 100) — the number of games.

Interaction

To make a query print a line "? Q" (1 ≤ Q ≤ 10^{18}). After that read one integer gcd(X, Q). You can make no more than 22 such queries during one game.

If you are confident that you have figured out the number of divisors of X with enough precision, you can print your answer in "! ans" format. ans have to be an integer. If this was the last game, you have to terminate the program, otherwise you have to start the next game immediately. Note that the interactor doesn't print anything in response to you printing answer.

After printing a query do not forget to output end of line and flush the output. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



Hacks

To hack, use the following format:

The first line contains one integer T (1 ≤ T ≤ 100) — the number of games.

Each of the next T lines contains one integer X (1 ≤ X ≤ 10^{9}) — the hidden number.

So the example has the form 
    
    
      
    2  
    998244353  
    4194304  
    

Example

Input


2

1

1

1


1024

1048576

4194304


Output



? 982306799268821872

? 230856864650023977

? 134690134760714371

! 5
? 1024

? 1048576

? 1073741824

! 42

Note

Why the limitation for number of queries is 22 exactly? Maybe the problem author is a Taylor Swift fan.

Let's look at the example.

In the first game X = 998 244 353 is hidden. Would be hard to guess this, right? This number is prime, so the number of its divisors is 2. The solution has made several random queries, and all the responses turned out to be 1 (strange things, not even one of three random numbers is divisible by 998 244 353). It's fare to assume that the hidden number doesn't have many divisors, so the solution has answered 5. Why not. This answer will be considered correct since | 5 - 2 | = 3 ≤ 7.

In the second game X = 4 194 304 = 2^{22} is hidden, it has 23 divisors. The solution has made queries 1024 = 2^{10}, 1 048 576 =2^{20}, 1 073 741 824 = 2^{30} and got responses 1024 = 2^{10}, 1 048 576 =2^{20}, 4 194 304 = 2^{22}, respectively. Then the solution got completely confused and answered the answer to The Ultimate Question of Life, the Universe, and Everything. This answer will be considered correct since 1/2 ≤ 42/23 ≤ 2.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void *wmem;
char memarr[96000000];
template <class S, class T>
inline S min_L(S a, T b) {
  return a <= b ? a : b;
}
template <class S, class T>
inline S max_L(S a, T b) {
  return a >= b ? a : b;
}
template <class T>
inline void walloc1d(T **arr, int x, void **mem = &wmem) {
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) & 15]);
  (*arr) = (T *)(*mem);
  (*mem) = ((*arr) + x);
}
int Prime_L(int N, int res[], void *mem = wmem) {
  int i;
  int a;
  int b;
  int sz = 1;
  const int r = 23000;
  bool *isprime;
  int *sf;
  int ss = 1;
  walloc1d(&isprime, r, &mem);
  walloc1d(&sf, r, &mem);
  isprime = (bool *)mem;
  sf = (int *)(isprime + r);
  N /= 2;
  res[0] = 2;
  b = min_L(r, N);
  for (i = (1); i < (b); i++) {
    isprime[i] = 1;
  }
  for (i = (1); i < (b); i++) {
    if (isprime[i]) {
      res[sz++] = 2 * i + 1;
      sf[ss] = 2 * i * (i + 1);
      if (sf[ss] < N) {
        while (sf[ss] < r) {
          isprime[sf[ss]] = 0;
          sf[ss] += res[ss];
        }
        ss++;
      }
    }
  }
  for (a = r; a < N; a += r) {
    b = min_L(a + r, N);
    isprime -= r;
    for (i = (a); i < (b); i++) {
      isprime[i] = 1;
    }
    for (i = (1); i < (ss); i++) {
      while (sf[i] < b) {
        isprime[sf[i]] = 0;
        sf[i] += res[i];
      }
    }
    for (i = (a); i < (b); i++) {
      if (isprime[i]) {
        res[sz++] = 2 * i + 1;
      }
    }
  }
  return sz;
}
template <class T>
int Factor_L(T N, T fac[], int fs[]) {
  T i;
  int sz = 0;
  if (N % 2 == 0) {
    fac[sz] = 2;
    fs[sz] = 1;
    N /= 2;
    while (N % 2 == 0) {
      N /= 2;
      fs[sz]++;
    }
    sz++;
  }
  for (i = 3; i * i <= N; i += 2) {
    if (N % i == 0) {
      fac[sz] = i;
      fs[sz] = 1;
      N /= i;
      while (N % i == 0) {
        N /= i;
        fs[sz]++;
      }
      sz++;
    }
  }
  if (N > 1) {
    fac[sz] = N;
    fs[sz] = 1;
    sz++;
  }
  return sz;
}
template <class T>
int Divisor_L(T N, T res[], void *mem = wmem) {
  int i;
  int j;
  int k;
  int s;
  int sz = 0;
  T *fc;
  int *fs;
  int fsz;
  walloc1d(&fc, 100, &mem);
  walloc1d(&fs, 100, &mem);
  fsz = Factor_L(N, fc, fs);
  res[sz++] = 1;
  for (i = (0); i < (fsz); i++) {
    s = sz;
    k = s * fs[i];
    for (j = (0); j < (k); j++) {
      res[sz++] = res[j] * fc[i];
    }
  }
  sort(res, res + sz);
  return sz;
}
long long query(long long Q) {
  printf("? %lld\n", Q);
  fflush(stdout);
  scanf("%lld", &Q);
  return Q;
}
void answer(long long ans) {
  printf("! %lld\n", ans);
  fflush(stdout);
}
int ps;
int p[10000];
long long tmp[100000];
int main() {
  int Lj4PdHRW;
  wmem = memarr;
  int T;
  int i;
  int j;
  int k;
  int s;
  int res;
  long long Q;
  long long X;
  long long now;
  ps = Prime_L(10000, p);
  scanf("%d", &T);
  for (Lj4PdHRW = (0); Lj4PdHRW < (T); Lj4PdHRW++) {
    int WYIGIcGE, e98WHCEY;
    s = 0;
    X = 1;
    for (e98WHCEY = (0); e98WHCEY < (18); e98WHCEY++) {
      Q = 1;
      while ((double)Q * p[s] < 1e18) {
        Q *= p[s++];
      }
      X *= query(Q);
    }
    now = X;
    for (WYIGIcGE = (0); WYIGIcGE < (4); WYIGIcGE++) {
      now *= now;
      now = query(now);
    }
    res = Divisor_L(now, tmp);
    answer(max_L(8, 2 * res));
  }
  return 0;
}
