#include <bits/stdc++.h>

using namespace std;

const int N = 2005;
int n, a[N], pre[N], rv[N];

int ask(int l, int r) {
    if (l == r) return 0;
    int res; printf("? %d %d\n", l, r);
    fflush(stdout);
    scanf("%d", &res);
    return res;
}

int qry(int a, int b) {
    return ask(a, b) ^ ask(a, b - 1) ^ pre[b];
}

void solve(int l, int r) {
    if (l == r) {
        rv[a[r] = 1] = r;
        return;
    }
    solve(l + 1, r);
    int L = 1, R = r - l, res = 0;
    while (L <= R) {
        int mid = (L + R) >> 1;
        int cmp = qry(l, rv[mid]);
        if (cmp) res = mid, L = mid + 1;
        else R = mid - 1;
    }
    rv[a[l] = res + 1] = l;
    for (int i = l + 1; i <= r; i++) {
        if (a[i] >= a[l]) {
            rv[++a[i]] = i;
        }
    }
    for (int i = l + 1; i <= r; i++) {
        if (a[l] > a[i]) pre[i] ^= 1;
    }
}

int main() {
    scanf("%d", &n);
    solve(1, n);
    printf("! ");
    for (int i = 1; i <= n; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    return 0;
}