#include <bits/stdc++.h>
using namespace std;
void Open() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int dx[]{1, -1, 0, 0, 1, 1, -1, -1};
int dy[]{0, 0, 1, -1, 1, -1, 1, -1};
const int OO = 0x3f3f3f3f;
long long n, t = 1;
int ask(int x, int y) {
  cout << '?' << ' ' << x << ' ' << y << endl;
  return cin >> x, x;
}
void test_case() {
  cin >> n;
  vector<int> a(n + 1);
  int w1 = ask(1, 2), w2 = ask(2, 3), w3 = ask(1, 3);
  a[2] = (w2 + w1 - w3) / 2;
  a[1] = w1 - a[2], a[3] = w3 - a[1];
  for (int i = 4; i <= n; i++) {
    int x = ask(1, i);
    a[i] = x - a[1];
  }
  cout << '!' << ' ';
  for (int i = 1; i <= n; i++) {
    cout << a[i];
    if (i < n) cout << ' ';
  }
}
int main() {
  Open();
  while (t--) {
    test_case();
  }
}
