#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int sum = (1+n)*n/2;
    vector<int> a(n);
    cout << "? " << 1 << " " << n-1 << endl;
    int r; cin >> r;
    a.back() = sum-r;
    int pre = a.back();
    sum = r;
    for(int i=n-2;i>0;i--){
        cout << "? " << i+1 << " " << n << endl;
        cin >> r;
        a[i] = r-pre;
        pre = r;
        sum -= a[i];
    }
    a[0] = sum;
    cout << "!";
    for(int i=0;i<n;i++){
        cout << " " << a[i];
    }
    cout << endl;
}