// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

void ask(int l, int r) {
    cout << "? " << l << " " << r << endl;
    cout << flush;
}

void ans(vi p) {
    cout << "! ";
    repi(i, 1, p.size()) cout << p[i] << " \n"[i==p.size()-1];
    cout << flush;
}

void solve() {
    int n;
    cin >> n;
    int sum = n*(n+1)/2;
    vi tot(n+2);
    tot[1] = sum;
    tot[n+1] = 0;
    repi(i, 1, n-1) {
        ask(i+1, n);
        cin >> tot[i+1];
    }
    ask(1, n-1);
    cin >> tot[n];
    tot[n] = sum - tot[n];
    vi p(n+1);
    repi(i, 1, n+1) p[i] = tot[i] - tot[i+1];
    ans(p);
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}