Problem: This is an interactive problem. You should use flush operation after each printed line. For example, in C++ you should use fflush(stdout), in Java you should use System.out.flush(), and in Pascal — flush(output).

In this problem you should guess an array a which is unknown for you. The only information you have initially is the length n of the array a.

The only allowed action is to ask the sum of two elements by their indices. Formally, you can print two indices i and j (the indices should be distinct). Then your program should read the response: the single integer equals to ai + aj.

It is easy to prove that it is always possible to guess the array using at most n requests.

Write a program that will guess the array a by making at most n requests.

Interaction

In each test your program should guess a single array.

The input starts with a line containing integer n (3 ≤ n ≤ 5000) — the length of the array. Your program should read it at first.

After that your program should print to the standard output the requests about the sum of two elements or inform that the array is guessed.

  * In case your program is making a request to ask the sum of two elements, it should print line in the format "? i j" (i and j are distinct integers between 1 and n), where i and j are indices in the array a.
  * In case your program informs that the array is guessed, it should print line in the format "! a1 a2 ... an" (it is guaranteed that all ai are positive integers not exceeding 105), where ai is the i-th element of the array a. 



The response on a request is a single integer equal to ai + aj, printed on a separate line.

Your program can do at most n requests. Note that the final line «! a1 a2 ... an» is not counted as a request.

Do not forget about flush operation after each printed line.

After you program prints the guessed array, it should terminate normally.

Example

Input

5
 
9
 
7
 
9
 
11
 
6
 

Output

 
? 1 5
 
? 2 3
 
? 4 1
 
? 5 2
 
? 3 4
 
! 4 6 1 5 5

Note

The format of a test to make a hack is:

  * The first line contains an integer number n (3 ≤ n ≤ 5000) — the length of the array.
  * The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — the elements of the array to guess. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long mod(long long x) {
  if (x >= 0) {
    return x;
  }
  return -x;
}
vector<long long> countDigit(long long n) {
  vector<long long> ret;
  while (n != 0) {
    ret.push_back(n % 10);
    n = n / 10;
  }
  return ret;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm1(long long a, long long b) { return (a / gcd(a, b)) * b; }
bool prime[1000000];
void SieveOfEratosthenes(long long n) {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
bool isPowerOfTwo(long long n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
bool PowerOfFour(long long num) {
  if (num <= 0) return false;
  while (num != 1) {
    if (num % 4 != 0) return false;
    num = num / 4;
  }
  return true;
}
bool compare(pair<long long, long long> p1, pair<long long, long long> p2) {
  if (p1.first != p2.first) {
    return p1.first < p2.first;
  } else {
    p1.second < p2.second;
  }
}
bool compare1(pair<long long, long long> p1, pair<long long, long long> p2) {
  if (p1.second != p2.second) {
    return p1.second < p2.second;
  } else {
    p1.first < p2.first;
  }
}
long long localMinUtil(long long arr[], long long low, long long high,
                       long long n) {
  long long mid = low + (high - low) / 2;
  if ((mid == 0 || arr[mid - 1] > arr[mid]) &&
      (mid == n - 1 || arr[mid + 1] > arr[mid]))
    return mid;
  else if (mid > 0 && arr[mid - 1] < arr[mid])
    return localMinUtil(arr, low, (mid - 1), n);
  return localMinUtil(arr, (mid + 1), high, n);
}
bool check(long long mid, long long maxi,
           vector<pair<long long, long long>>& v) {
  long long curr = 0;
  if (mid == v.size() - 1) {
    return true;
  }
  for (long long i = 0; i <= mid; i++) {
    curr += v[i].first;
  }
  bool can = true;
  for (long long i = mid + 1; i < v.size(); i++) {
    if (v[i].first > curr) {
      can = false;
      break;
    }
    curr += v[i].first;
  }
  return can;
}
long long ask(long long i, long long j) {
  cout << "?"
       << " " << i << " " << j << endl;
  fflush(stdout);
  long long val;
  cin >> val;
  return val;
}
void solve() {
  long long n;
  cin >> n;
  long long a1;
  long long a2;
  long long a3;
  long long ans1 = ask(1, 2);
  long long ans2 = ask(1, 3);
  long long ans3 = ask(2, 3);
  a1 = (ans1 + ans2 - ans3) / 2;
  a2 = ans1 - a1;
  a3 = ans2 - a1;
  vector<long long> ret;
  ret.push_back(a1);
  ret.push_back(a2);
  ret.push_back(a3);
  for (long long i = 4; i <= n; i++) {
    long long val2 = ask(i, 1);
    ret.push_back(val2 - a1);
  }
  cout << "!"
       << " ";
  for (long long i = 0; i < n; i++) {
    cout << ret[i] << " ";
  }
  cout << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}