#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 2999;
int n, pos[N], p[N], cnt, sum[N], ans[N][N], vis[N][N];
int ask(int l, int r){
    if(l == r)
        return 0;
    if(vis[l][r])
        return ans[l][r];
    cout << "? " << l << " " << r << '\n';
    cout.flush();
    cnt++;
    assert(cnt <= 40000);
    int x;
    cin >> x;
    ans[l][r] = x;
    vis[l][r] = 1;
    return x;
}
int count(int id, int l, int r){
    int x = 0;
    for (int j = l; j <= r; j++)
        if(p[j] < p[id])
            x ^= 1;
    return x;
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    pos[1] = p[1] = 1;
    for (int i = 2; i <= n; i++){
        if(ask(pos[i-1], i) == ask(pos[i-1] + 1, i) ^ sum[pos[i-1]]){
            p[i] = i;
            pos[i] = i;
            continue;
        }
        int l = 1, r = i - 1, mid;
        while(l < r){
            mid = (l + r) >> 1;
            if(ask(pos[mid], i) != ask(pos[mid] + 1, i) ^ sum[pos[mid]])
                r = mid;
            else
                l = mid + 1;
        }
        p[i] = l;
        pos[l] = i;
        for (int j = 1; j < i; j++)
            if(p[j] >= l){
                p[j]++;
                pos[p[j]] = j;
            }
        sum[i] = 0;
        for(int j = i; j >= 1; j--)
            if(p[j] > p[i])
                sum[j] = sum[j + 1] ^ 1;
            else
                sum[j] = sum[j + 1];
    }
    cout << "! ";
    for(int i = 1; i <= n; i++)
        cout << p[i] << " \n"[i == n];
    cout.flush();
    return 0;
}