#include <bits/stdc++.h>
using namespace std;
int n, cnt = 0;
int query(int l, int r) {
  cnt++;
  assert(cnt <= n);
  cout << "? " << l << " " << r << endl;
  int response;
  cin >> response;
  return response;
}
int main(int argc, char const *argv[]) {
  cin >> n;
  vector<int> pref_sum(n);
  for (int i = 0; i < n - 1; i++) {
    pref_sum[n - i - 1] = query(1, n - i);
  }
  vector<int> ans(n);
  for (int i = n - 1; i > 1; i--) {
    ans[i] = pref_sum[i] - pref_sum[i - 1];
  }
  int first = query(2, n);
  ans[0] = pref_sum[n - 1] - first;
  int sum = accumulate(ans.begin(), ans.end(), 0);
  ans[1] = pref_sum[n - 1] - sum;
  for (int i = 0; i < n; i++) {
    if (i == 0) cout << "! ";
    cout << ans[i] << " ";
  }
  cout << endl;
}
