#include <bits/stdc++.h>
using namespace std;
const long long INF = 2000000000000000001, mod = 1000000007;
int main() {
  int n;
  cin >> n;
  int a[n], c[n];
  if (n % 2)
    for (int i = 0; i < n; i++) {
      int a = i, b = i + 1;
      if (b == n) b = 0;
      cout << "? " << a + 1 << " " << b + 1 << "\n";
      fflush(stdout);
      cin >> c[i];
    }
  else
    for (int i = 0; i < n - 1; i++) {
      int a = i, b = i + 1;
      if (b == n - 1) b = 0;
      cout << "? " << a + 1 << " " << b + 1 << "\n";
      fflush(stdout);
      cin >> c[i];
    }
  if (n % 2) {
    a[0] = 0;
    for (int i = 0; i < n; i++) {
      if (i % 2)
        a[0] -= c[i];
      else
        a[0] += c[i];
    }
    a[0] >>= 1;
    for (int i = n - 1; i > 0; i--) {
      if (i == n - 1)
        a[i] = c[i] - a[0];
      else
        a[i] = c[i] - a[i + 1];
    }
  } else {
    a[0] = 0;
    for (int i = 0; i < n - 1; i++) {
      if (i % 2)
        a[0] -= c[i];
      else
        a[0] += c[i];
    }
    a[0] >>= 1;
    for (int i = n - 2; i > 0; i--) {
      if (i == n - 2)
        a[i] = c[i] - a[0];
      else
        a[i] = c[i] - a[i + 1];
    }
    cout << "? "
         << "1 " << n << "\n";
    cin >> c[n - 1];
    a[n - 1] = c[n - 1] - a[0];
  }
  cout << "! ";
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  return 0;
}
