#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
  return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
  return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
  return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <typename T>
string NumberToString(T Number) {
  ostringstream second;
  second << Number;
  return second.str();
}
inline int nxt() {
  int aaa;
  scanf("%d", &aaa);
  return aaa;
}
inline long long int lxt() {
  long long int aaa;
  scanf("%I64d", &aaa);
  return aaa;
}
inline double dxt() {
  double aaa;
  scanf("%lf", &aaa);
  return aaa;
}
template <class T>
inline T bigmod(T p, T e, T m) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
  }
  return (T)ret;
}
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
int ar[100010];
int main() {
  int n;
  cin >> n;
  int x, y, z;
  fflush(stdout);
  cout << "? 1 2" << endl;
  cin >> x;
  fflush(stdout);
  cout << "? 1 3" << endl;
  cin >> y;
  fflush(stdout);
  cout << "? 2 3" << endl;
  cin >> z;
  ar[1] = (x - z + y) / 2;
  ar[2] = x - ar[1];
  ar[3] = y - ar[1];
  for (int i = 4; i <= n; i++) {
    fflush(stdout);
    cout << "? 1 " << i << endl;
    cin >> x;
    ar[i] = x - ar[1];
  }
  printf("!");
  for (int i = 1; i <= n; i++) printf(" %d", ar[i]);
  printf("\n");
  return 0;
}
