#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007ll;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= MOD;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
  }
  return res;
}
template <typename t1, typename t2>
inline bool upmax(t1 &a, t2 b) {
  if (a < (t1)b) {
    a = (t1)b;
    return true;
  } else
    return false;
}
template <typename t1, typename t2>
inline bool upmin(t1 &a, t2 b) {
  if (a > (t1)b) {
    a = (t1)b;
    return true;
  } else
    return false;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int dkx[] = {-1, -1, 1, 1, -2, -2, 2, 2};
int dky[] = {-2, 2, -2, 2, -1, 1, -1, 1};
const int INF = 1000000404;
const long long LINF = 1e18 * (1ll);
const long double PI = 3.14159265358979323846;
const long double EPS = 1e-9;
const int SQ = 318;
int timer = 0;
int b[100100];
bool bad[1 << 14];
void solve() {
  for (int(i) = (0); (i) < (100); (i)++) {
    bool good = false;
    for (int(x) = (100); (x) < ((1 << 14)); (x)++) {
      if (bad[x]) continue;
      b[i] = x;
      good = true;
      for (int(j) = (0); (j) < (100); (j)++)
        for (int(k) = (j + 1); (k) < (100); (k)++) bad[j ^ k ^ x] = true;
      bad[x] = true;
      break;
    }
    if (!good) cout << -1 << endl;
  }
  int f1, f2;
  cout << "? ";
  for (int(i) = (0); (i) < (100); (i)++) cout << i << ' ';
  cout << endl;
  cin >> f1;
  cout << "? ";
  for (int(i) = (0); (i) < (100); (i)++) cout << b[i] << ' ';
  cout << endl;
  cin >> f2;
  for (int(i) = (0); (i) < (100); (i)++) {
    for (int(j) = (0); (j) < (100); (j)++) {
      if ((i ^ f1) == (b[j] ^ f2)) {
        cout << "! " << (i ^ f1) << endl;
        return;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
