#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
const ll MAX = 2e5;
const ll inf = 1e9;
const ll mod = 998244353;
ll a[MAX];
ll ask(ll l, ll r) {
  ll x;
  cout << "? " << l << " " << r << endl;
  cin >> x;
  return x;
}
int main() {
  ll tc, n;
  tc = 1;
  while (tc--) {
    cin >> n;
    ll sum = ask(1, n);
    ll to = sum;
    for (ll i = n - 1; i >= 2; i--) {
      ll aux = ask(1, i);
      a[i + 1] = sum - aux;
      sum = aux;
    }
    ll suf = ask(2, n);
    a[1] = to - suf;
    a[2] = sum - a[1];
    cout << "!";
    for (ll i = 1; i < (ll)n + 1; i++) cout << " " << a[i];
  }
  return 0;
}
