#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
vector<long long int> v;
vector<long long int> w, ab, bc;
set<long long int> uo;
map<long long int, long long int> ww, cc, u;
vector<pair<long long int, long long int> > uu, su;
map<long long int, vector<long long int> > uuu;
map<pair<long long int, long long int>, long long int> vo;
map<pair<long long int, long long int>, long long int> vu;
map<long long int, pair<long long int, pair<long long int, long long int> > >
    vs;
priority_queue<long long int, vector<long long int>, greater<long long int> >
    moy;
long long int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
long long int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
long long int dxx[] = {2, 1, -1, -2, -2, -1, 1, 2};
long long int dyy[] = {1, 2, 2, 1, -1, -2, -2, -1};
long long int dp[101][10001];
long long int ar[10][10];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char ch;
  string a, b, c;
  double x, y, d, e, f, g, h;
  long long int n, i, j, k, p, q, o, l, s, tt = 1, m, t, z, aa, r = 0;
  for (long long int mau = 1; mau <= tt; mau++) {
    v.clear();
    w.clear();
    ww.clear();
    uu.clear();
    uo.clear();
    vo.clear();
    vu.clear();
    ab.clear();
    bc.clear();
    cc.clear();
    uuu.clear();
    a.clear();
    b.clear();
    c.clear();
    u.clear();
    cin >> n;
    cout << "? " << 1 << " " << 2 << endl;
    cout.flush();
    cin >> p;
    cout << "? " << 1 << " " << 3 << endl;
    cout.flush();
    cin >> q;
    u[3] = q - p;
    cout << "? " << 2 << " " << 3 << endl;
    cout.flush();
    cin >> o;
    u[2] = o - u[3];
    u[1] = p - u[2];
    for (i = 4; i <= n; i++) {
      cout << "? " << i - 1 << " " << i << endl;
      cout.flush();
      cin >> p;
      u[i] = p - u[i - 1];
    }
    cout << "!";
    for (i = 1; i <= n; i++) {
      cout << " " << u[i];
    }
    cout << endl;
    cout.flush();
  }
  return 0;
}
