#include <bits/stdc++.h>
using namespace std;
const int N = 2005;

int n, a[N], ord[N], ans[N][N];
int ask(int l, int r) {
    if (l >= r) return 0; 
    if (ans[l][r] != -1) return ans[l][r]; 
    cout << "? " << l << ' ' << r << endl; 
    return cin >> ans[l][r], ans[l][r];
}
int cmp(int l, int r) {
    int num = ask(l, r) ^ ask(l, r - 1) ^ ask(l + 1, r) ^ ask(l + 1, r - 1);
    return num == 1; 
}
int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n; 
    memset(ans, -1, sizeof ans); 
    ord[1] = a[1] = 1; 
    for (int i = 1; i <= n; ++i) ans[i][i] = 0; 
    for (int i = 2; i <= n; ++i) {
        int l = 0, r = i; 
        while (l + 1 != r) {
            int mid = l + r >> 1; 
            if (cmp(ord[mid], i)) r = mid; // a[ord[mid]] > a[i]
            else l = mid; 
        }
        // a[ord[l]] < a[i]
        for (int j = i - 1; j >= r; --j) ord[j + 1] = ord[j]; 
        ord[r] = i; 

        for (int j = 1; j <= i; ++j) a[ord[j]] = j; 
        for (int j = i - 1; j >= 1; --j) ans[j][i] = (ans[j + 1][i] ^ (a[j] > a[i])); 
        for (int j = 1; j < i; ++j) ans[j][i] ^= ans[j][i - 1]; 
    }
    cout << "! ";
    for (int i = 1; i <= n; ++i) cout << a[i] << ' '; 
    cout << endl; 
    return 0; 
}