#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int maxn = 101010;
int n, last;
int arr[maxn], sum[maxn];
bool judge(int x) {
  arr[2] = (sum[2] + sum[3] - last) / 2;
  arr[1] = sum[2] - arr[2];
  for (int i = 3; i <= n; i++) {
    arr[i] = sum[i] - arr[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    if (arr[i] < 1 || arr[i] > 100000) return 0;
  }
  return 1;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; i++) {
    printf("? %d %d\n", i, i + 1);
    fflush(stdout);
    scanf("%d", &sum[i + 1]);
  }
  printf("? 1 3\n");
  fflush(stdout);
  scanf("%d", &last);
  for (int i = 1; i <= 100000; i++) {
    if (judge(i)) {
      printf("! ");
      for (int i = 1; i <= n; i++) {
        printf("%d", arr[i]);
        if (i == n)
          printf("\n");
        else
          printf(" ");
      }
      break;
    }
  }
  return 0;
}
