Problem: Jury picked a polynomial f(x) = a_0 + a_1 ⋅ x + a_2 ⋅ x^2 + ... + a_k ⋅ x^k. k ≤ 10 and all a_i are integer numbers and 0 ≤ a_i < 10^6 + 3. It's guaranteed that there is at least one i such that a_i > 0.

Now jury wants you to find such an integer x_0 that f(x_0) ≡ 0 mod (10^6 + 3) or report that there is not such x_0.

You can ask no more than 50 queries: you ask value x_q and jury tells you value f(x_q) mod (10^6 + 3).

Note that printing the answer doesn't count as a query.

Interaction

To ask a question, print "? x_q" (0 ≤ x_q < 10^6 + 3). The judge will respond with a single integer f(x_q) mod (10^6 + 3). If you ever get a result of −1 (because you printed an invalid query), exit immediately to avoid getting other verdicts.

After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. 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. 



When you are ready to answer, print "! x_0" where x_0 is the answer or -1 if there is no such x_0.

You can ask at most 50 questions per test case.

Hack Format

To hack, use the following format.

The only line should contain 11 integers a_0, a_1, ..., a_{10} (0 ≤ a_i < 10^6 + 3, max_{0 ≤ i ≤ 10}{a_i} > 0) — corresponding coefficients of the polynomial.

Examples

Input


 
1000002

0


Output


? 0

? 1

! 1

Input


 
5

2

1



Output


? 2

? 1

? 0

! -1

Note

The polynomial in the first sample is 1000002 + x^2.

The polynomial in the second sample is 1 + x^2.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e6 + 3;
const int MXROW = 1010;
const int MXCOL = 1010;
long long int a[MXROW][MXCOL];
inline long long int bigmod(long long int b, long long int p,
                            long long int MOD) {
  long long int res = 1 % MOD, x = b % MOD;
  while (p) {
    if (p & 1) res = (res * x) % MOD;
    x = (x * x) % MOD;
    p >>= 1;
  }
  return res % MOD;
}
inline int gaussian_elim(int n, int m, int MOD, vector<long long int> &res) {
  res.assign(m, 0);
  vector<long long int> pos(m, -1);
  int i, j, k, l, p, free_var = 0;
  long long int d;
  const long long MODSQ = 1LL * MOD * MOD;
  for (j = 0, i = 0; j < m && i < n; j++) {
    for (k = i, p = i; k < n; k++) {
      if (a[k][k] > a[p][j]) p = k;
    }
    if (a[p][j]) {
      pos[j] = i;
      for (l = j; l <= m; l++) swap(a[p][l], a[i][l]);
      d = bigmod(a[i][j], MOD - 2, MOD);
      for (k = 0; k < n && d; k++) {
        if (k != i && a[k][j]) {
          long long int x = (a[k][j] % MOD * d % MOD) % MOD;
          for (l = j; l <= m && x; l++) {
            if (a[i][l])
              a[k][l] = (MODSQ + a[k][l] - (a[i][l] % MOD * x % MOD)) % MOD;
          }
        }
      }
      i++;
    }
  }
  for (i = 0; i < m; i++) {
    if (pos[i] == -1)
      free_var++;
    else
      res[i] = (a[pos[i]][m] * bigmod(a[pos[i]][i], MOD - 2, MOD)) % MOD;
  }
  for (i = 0; i < n; i++) {
    long long int val = 0;
    for (j = 0; j < m; j++) val = (val + (res[j] * a[i][j])) % MOD;
    if (val != a[i][m]) return -1;
  }
  return free_var;
}
int main(int argc, char const *argv[]) {
  int n = 11, m = 11;
  for (int i = 0; i < n; i++) {
    long long int mul = 1;
    for (int j = 0; j < m; j++) {
      a[i][j] = mul;
      mul = (mul % MOD * i % MOD) % MOD;
    }
    cout << "? " << i << endl;
    long long int fx;
    cin >> fx;
    a[i][m] = fx;
  }
  vector<long long int> res;
  int free_var = gaussian_elim(n, m, MOD, res);
  assert(free_var == 0);
  for (int i = 0; i < MOD; i++) {
    long long int fx = 0, mul = 1;
    for (int j = 0; j < m; j++) {
      fx += (1LL * mul * res[j]) % MOD, fx %= MOD;
      mul = (1LL * mul * i) % MOD;
    }
    if (fx == 0) {
      cout << "! " << i << endl;
      return 0;
    }
  }
  cout << "! -1" << endl;
  return 0;
}