#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
template <class t>
inline t read(t &x) {
  char c = getchar();
  bool f = 0;
  x = 0;
  while (!isdigit(c)) f |= c == '-', c = getchar();
  while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  if (f) x = -x;
  return x;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0)
    putchar('-'), write(-x);
  else {
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
  }
}
const int N = 1005;
int n, a[N], b[N];
signed main() {
  read(n);
  for (int i = 2; i <= n; i++) {
    cout << "? 1 " << i << endl;
    read(a[i]);
  }
  for (int i = n; i >= 3; i--) b[i] = a[i] - a[i - 1];
  cout << "? 2 " << n << endl;
  read(b[1]);
  b[1] = a[n] - b[1];
  b[2] = a[n];
  for (int i = 1; i <= n; i++)
    if (i != 2) b[2] -= b[i];
  cout << "!";
  for (int i = 1; i <= n; i++) cout << " " << b[i];
  cout << endl;
}
