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

const int N = 2005;
int n, ans[N];

void solve(int l, int r) {
    if(l == r) return ;
    int mid = l + r >> 1, x = 0, y = 0, t;
    cout << "? " << l << " " << mid << endl;
    cin >> x; cout << endl;
    cout << "? " << mid + 1 << " " << r << endl;
    cin >> y; cout << endl;
    for(int i = mid; i >= l; i --) {
        cout << "? " << i << " " << r << endl;
        cin >> t; cout << endl;
        ans[i] += (t - y);
        y = t;
    }
    y = 0;
    for(int i = mid - 1; i >= l; i --) {
        cout << "? " << i << " " << mid << endl;
        cin >> t; cout << endl;
        ans[i] -= (t - y);
        y = t;
    }
    for(int i = mid + 1; i <= r; i ++) {
        cout << "? " << l << " " << i << endl;
        cin >> t; cout << endl;
        ans[i] += i - l - (t - x);
        x = t;
    }
    x = 0;
    for(int i = mid + 2; i <= r; i ++) {
        cout << "? " << mid + 1 << " " << i << endl;
        cin >> t; cout << endl;
        ans[i] -= i - (mid + 1) - (t - x);
        x = t;
    }
    solve(l, mid), solve(mid + 1, r);
}

int main() {
    cin >> n;
    cout << endl;
    solve(1, n);
    cout << "! ";
    for(int i = 1; i <= n; i ++) cout << ans[i] + 1 << " ";
    cout << endl;

    return 0;
}