#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template <class T>
inline bool ckmin(T& a, T b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
inline bool ckmax(T& a, T b) {
  return b > a ? a = b, 1 : 0;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
int qry(int l, int r) {
  cout << "? " << l << " " << r << endl;
  int res;
  cin >> res;
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int q[3];
  q[0] = qry(1, 2);
  q[1] = qry(2, 3);
  q[2] = qry(1, 3);
  vi res(n + 1, 0);
  res[2] = q[0] + q[1] - q[2];
  res[1] = q[0] - res[2];
  res[3] = q[1] - res[2];
  assert(res[1] + res[2] + res[3] == q[2]);
  for (int i = (4); i < (n + 1); i++) {
    int tmp = qry(i - 1, i);
    res[i] = tmp - res[i - 1];
  }
  cout << "! ";
  for (int i = (1); i < (n + 1); i++) cout << res[i] << " ";
  cout << endl;
  return 0;
}
