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;
const long long p = 1e9 + 7;
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
class dsu {
 public:
  unordered_map<int, int> p, sz;
  void make_set(int x) {
    p[x] = x;
    sz[x] += 1;
  }
  int find(int x) {
    if (x == p[x]) return x;
    return p[x] = find(p[x]);
  }
  void merge(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b) return;
    if (sz[a] < sz[b]) swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
    sz.erase(b);
  }
};
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y >>= 1;
    x = (x * x);
  }
  return res;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y >>= 1;
    x = (x * x) % p;
  }
  return res;
}
int kmp(string s) {
  vector<int> lps(s.size(), 0);
  for (int i = 1; i < lps.size(); ++i) {
    int prev_index = lps[i - 1];
    while (prev_index > 0 && s[i] != s[prev_index]) {
      prev_index = lps[prev_index - 1];
    }
    lps[i] = prev_index + (s[i] == s[prev_index] ? 1 : 0);
  }
  return lps[lps.size() - 1];
}
long long modi(long long x, long long y) { return power(x, y - 2, y); }
const int MAXN = 1e5 + 1;
vector<int> adj[MAXN];
vector<vector<int>> path(3, vector<int>(MAXN));
void dfs(vector<bool> &vis, int s, vector<map<int, long long>> &V,
         vector<int> &a) {
  vis[s] = true;
  for (auto it : adj[s]) {
    if (!vis[it]) {
      map<int, long long> mp = V[s];
      int temp = a[it];
      for (int j = 2; j <= sqrt(temp); j++) {
        if (temp % j == 0) {
          long long cnt = 0;
          while (temp % j == 0) {
            cnt++;
            temp /= j;
          }
          auto itr = mp.find(j);
          if (itr == mp.end())
            mp[j] = cnt;
          else
            mp[j] = (mp[j] + cnt) % p;
        }
      }
      if (temp > 1) {
        auto itr = mp.find(temp);
        if (itr == mp.end())
          mp[temp] = 1;
        else
          mp[temp] = (mp[temp] + 1) % p;
      }
      V[it] = mp;
      dfs(vis, it, V, a);
    }
  }
}
void dfs(int cur, int prev, int pathNumber, int ptr, int node, bool &flag) {
  for (int i = 0; i < adj[cur].size(); i++) {
    if (adj[cur][i] != prev and !flag) {
      path[pathNumber][ptr] = adj[cur][i];
      if (adj[cur][i] == node) {
        flag = true;
        path[pathNumber][ptr + 1] = -1;
        return;
      }
      dfs(adj[cur][i], cur, pathNumber, ptr + 1, node, flag);
    }
  }
}
int LCA(int a, int b) {
  if (a == b) return a;
  path[1][0] = path[2][0] = 1;
  bool flag = false;
  dfs(1, 0, 1, 1, a, flag);
  flag = false;
  dfs(1, 0, 2, 1, b, flag);
  int i = 0;
  while (path[1][i] == path[2][i]) i++;
  return path[1][i - 1];
}
bool check(vector<int> &a) {
  for (int i = 0; i < a.size(); i++)
    if (a[i] == -1) return false;
  return true;
}
int place(vector<int> &a, int num) {
  for (int i = 0; i < a.size(); i++)
    if (a[i] > num) return i;
  return -1;
}
int last(vector<int> &a) {
  for (int i = a.size() - 1; i >= 0; i--) {
    if (a[i] != -1) return i + 1;
  }
  return 0;
}
void solve() {
  int n, end, s1, s2, s3;
  cin >> n;
  vector<int> a(n + 1);
  cout << "? " << 1 << ' ' << n << endl;
  cin >> s1;
  cout << "? " << 1 << ' ' << n - 1 << endl;
  cin >> s2;
  cout << "? " << n - 1 << ' ' << n << endl;
  cin >> s3;
  a[1] = (s1 + s2 - s3) / 2;
  a[n - 1] = (s3 - s1 + s2) / 2;
  a[n] = (s1 - s2 + s3) / 2;
  for (int i = 2; i < n - 1; i++) {
    cout << "? " << i - 1 << ' ' << i << endl;
    cin >> end;
    a[i] = end - a[i - 1];
  }
  cout << "! ";
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
  cout << endl;
}
int main() {
  fastio();
  solve();
}