#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000 + 3;
long long a[15], b[20][20], c[20], xx[20], y;
long long qpow(long long u, long long v) {
  long long ans = 1;
  while (v) {
    if (v & 1) ans = ans * u % mod;
    v >>= 1;
    u = u * u % mod;
  }
  return ans;
}
void solve() {
  for (int i = 0; i <= 10; i++) {
    for (int j = 10; j > i; j--) {
      y = c[j - 1] * b[j][i] % mod;
      c[j] = c[j] * b[j - 1][i] % mod;
      for (int k = 0; k <= 10; k++) {
        xx[k] = b[j - 1][k] * b[j][i] % mod;
      }
      for (int k = 0; k <= 10; k++) {
        b[j][k] = b[j][k] * b[j - 1][i] % mod;
      }
      for (int k = 0; k <= 10; k++) {
        b[j][k] = ((b[j][k] - xx[k]) % mod + mod) % mod;
      }
      c[j] = ((c[j] - y) % mod + mod) % mod;
    }
  }
  for (int i = 10; i >= 0; i--) {
    long long tmp = 0;
    for (int j = 10; j > i; j--) {
      tmp = (tmp + a[j] * b[i][j] % mod) % mod;
    }
    c[i] = ((c[i] - tmp) % mod + mod) % mod;
    a[i] = c[i] * qpow(b[i][i], mod - 2);
  }
}
long long getnum(long long vv) {
  int num[11] = {2, 9, 1, 4, 8, 10, 0, 2, 8, 7, 6};
  long long tmp = 1, tot = 0;
  for (int i = 0; i < 11; i++) {
    tot = (tot + num[i] * tmp % mod) % mod;
    tmp = tmp * vv % mod;
  }
  return tot;
}
int main(void) {
  long long d;
  for (long long i = 0; i <= 10; i++) {
    printf("? %lld\n", i);
    fflush(stdout);
    scanf("%lld", &c[i]);
    long long d = 1;
    for (long long j = 0; j <= 10; j++) {
      b[i][j] = d;
      d = d * i % mod;
    }
  }
  solve();
  for (long long i = 0; i < mod; i++) {
    long long ans = 0;
    long long tmp = 1;
    for (long long j = 0; j < 11; j++) {
      ans = (ans + a[j] * tmp % mod) % mod;
      tmp = tmp * i % mod;
    }
    if (ans == 0) {
      printf("! %lld\n", i);
      fflush(stdout);
      return 0;
    }
  }
  printf("! -1\n");
  fflush(stdout);
  return 0;
}
