#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long expo_pow(long long x, long long y) {
  if (y == 0) return 1;
  y = y % (mod - 1);
  x %= mod;
  if (y == 0) y = mod - 1;
  long long res = 1;
  while (y) {
    if (y & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    y >>= 1;
  }
  return res;
}
long long add() { return 0; }
template <typename T, typename... Types>
T add(T var1, Types... var2) {
  return (((((long long)(var1)) % mod + (long long)(add(var2...))) % mod) +
          mod) %
         mod;
}
long long mul() { return 1; }
template <typename T, typename... Types>
T mul(T var1, Types... var2) {
  return (((long long)(var1)) % mod * (long long)(mul(var2...))) % mod;
}
long long ask(long long l, long long r) {
  cout << "? " << l << " " << r << endl;
  long long tmp;
  cin >> tmp;
  return tmp;
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> ans(n + 1);
  long long tmp1 = ask(1, 2);
  long long tmp2 = ask(2, 3);
  long long tmp3 = ask(1, 3);
  ans[2] = tmp1 + tmp2 - tmp3;
  ans[1] = tmp1 - ans[2];
  ans[3] = tmp2 - ans[2];
  for (long long i = 4; i <= n; ++i) {
    long long tmp = ask(i - 1, i);
    ans[i] = tmp - ans[i - 1];
  }
  cout << "! ";
  for (long long i = 1; i <= n; ++i) cout << ans[i] << " ";
  cout << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long test = 1;
  long long i = 1;
  while (test--) {
    solve();
  }
}
