#include <bits/stdc++.h>
using namespace std;
void inversemod(long long int n, long long int mod, long long int invmod[],
                long long int MOD) {
  for (int i = 2; i <= n; ++i)
    invmod[i] = MOD - MOD / i * invmod[MOD % i] % MOD;
}
int main() {
  int n;
  cin >> n;
  int arr[n + 10];
  for (int i = 1; i < n; i++) {
    printf("? 1 %d\n", i + 1);
    fflush(stdout);
    cin >> arr[i];
  }
  printf("? 2 3\n");
  fflush(stdout);
  int a;
  cin >> a;
  arr[0] = (arr[1] - a + arr[2]) / 2;
  for (int i = 1; i < n; i++) arr[i] -= arr[0];
  cout << "! ";
  for (int i = 0; i < n; ++i) {
    cout << arr[i] << ' ';
  }
  cout << endl;
}
