#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, vis[N][N], ans[N][N];
int ask(int l, int r){
    if(l == r)
        return 0;
    assert(l <= r);
    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 a[N] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
// int ask(int l, int r){
//     //cout << l << " " << r << '\n';
//     int x = 0;
//     for (int i = l; i <= r; i++)
//         for (int j = i + 1; j <= r; j++)
//             if(a[j] < a[i])
//                 x ^= 1;
//     //cout << x << '\n';
//     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++){
        int l = 1, r = i - 1, mid;
        while(l < r){
            mid = (l + r) >> 1;
            if(ask(pos[mid], i) != ask(pos[mid] + 1, i) ^ count(pos[mid], pos[mid], i-1))
                r = mid;
            else
                l = mid + 1;
        }
        if(l == i - 1 && ask(pos[l], i) == ask(pos[l] + 1, i) ^ count(pos[l], pos[l], i-1)){
            p[i] = i;
            pos[i] = i;
            continue;
        }
        p[i] = l;
        pos[l] = i;
        for (int j = 1; j < i; j++)
            if(p[j] >= l){
                p[j]++;
                pos[p[j]] = j;
            }
    }
    cout << "! ";
    for(int i = 1; i <= n; i++)
        cout << p[i] << " \n"[i == n];
    cout.flush();
    return 0;
}