#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void solve() {}
int main() {
  long long int n;
  cin >> n;
  vector<long long int> ans;
  long long int sum = 0;
  cout << "? 1 " << n << "\n";
  cin >> sum;
  long long int t, e;
  for (int i = 0; i < n - 2; i++) {
    cout << "? " << i + 2 << " " << n << "\n";
    cin >> t;
    e = sum - t;
    ans.push_back(e);
    sum -= e;
  }
  cout << "? " << n - 2 << " " << n - 1 << "\n";
  cin >> t;
  ans.push_back(t - ans.back());
  ans.push_back(sum - ans.back());
  cout << "! ";
  for (int i = (0); i < (n); i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
