#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int ar[n + 1];
  int three = 0, first_two = 0, last_two = 0;
  int large = 0, small = 0;
  for (int i = (1); i < (n + 1); i++) {
    if (i == n) {
      cout << "? " << n - 2 << " " << n - 1 << "\n";
      fflush(stdout);
      cin >> first_two;
      ar[n] = three - first_two;
      ar[n - 1] = last_two - ar[n];
      break;
    }
    cout << "? " << i << " " << n << "\n";
    fflush(stdout);
    cin >> small;
    if (i == n - 2) three = small;
    if (i == n - 1) last_two = small;
    if (i > 1) {
      ar[i - 1] = large - small;
    }
    large = small;
  }
  cout << "! ";
  for (int i = (1); i < (n + 1); i++) {
    cout << ar[i] << " ";
  }
  cout << "\n";
  fflush(stdout);
}
int main() {
  int t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
