#include <bits/stdc++.h>
using namespace std;
int A[1003];
void solveCase() {
  int n, sm1, sm2, sm3, prevSm, sm;
  long long ans = 0;
  cin >> n;
  cout << "? 1 2\n";
  cin >> sm1;
  fflush(stdout);
  cout << "? 1 3\n";
  cin >> sm2;
  fflush(stdout);
  cout << "? 2 3\n";
  cin >> sm3;
  fflush(stdout);
  A[1] = sm2 - sm3;
  A[2] = sm1 - A[1];
  A[3] = sm2 - sm1;
  prevSm = A[1] + A[2] + A[3];
  for (int i = 4; i < n + 1; ++i) {
    cout << "? 1 " << i << "\n";
    cin >> sm;
    fflush(stdout);
    A[i] = sm - prevSm;
    prevSm = sm;
  }
  string res = "!";
  for (int i = 1; i < n + 1; ++i) {
    res += " ";
    res += to_string(A[i]);
  }
  cout << res << "\n";
  fflush(stdout);
}
int main() {
  int t = 1;
  for (int tc = 1; tc < t + 1; ++tc) {
    solveCase();
  }
}
