#include <bits/stdc++.h>
using namespace std;
inline long long int maxim(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
inline long long int minim(long long int a, long long int b) {
  if (a < b)
    return a;
  else
    return b;
}
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
bool prime[10002];
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= 10001; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 10001; i += p) prime[i] = false;
    }
  }
}
long long int binpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}
long long int modpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
int modInverse(int a, int m) {
  int m0 = m;
  int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    int q = a / m;
    int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long int func(long long int h) { return (h * (3 * h + 1)) / 2; }
long long int bs(long long int low, long long int high, long long int target) {
  while (low + 3 < high) {
    long long int mid = (low + high) / 2;
    if (func(mid) <= target) {
      low = mid;
    } else {
      high = mid - 1;
    }
  }
  for (long long int o = (high), _b = (low); o >= _b; o--) {
    if (func(o) <= target) {
      return o;
    }
  }
  return -1;
}
long long int arr[1000010];
long long int visited[1000010] = {0};
long long int mat[50][50];
vector<long long int> teleporter;
map<long long int, long long int> m;
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  cout << setprecision(10) << fixed;
  vector<long long int> cont;
  long long int n;
  cin >> n;
  cout << "? " << 1 << " " << 2 << endl;
  long long int a;
  cin >> a;
  cout << "? " << 2 << " " << 3 << endl;
  long long int b;
  cin >> b;
  cout << "? " << 1 << " " << 3 << endl;
  long long int c;
  cin >> c;
  long long int d = (a + b + c) / 2;
  cont.push_back(d - b);
  cont.push_back(d - c);
  cont.push_back(d - a);
  for (long long int o = (4), _b = (n); o <= _b; o++) {
    cout << "? " << o - 1 << " " << o << endl;
    long long int z;
    cin >> z;
    z -= cont[cont.size() - 1];
    cont.push_back(z);
  }
  cout << "! ";
  for (long long int t = 0, _n = (cont.size()); t < _n; t++)
    cout << cont[t] << " ";
  cout << endl;
  return 0;
}
