#include <cstdio>
#include <cstring>

const int maxn = 2e3 + 5;
int f[maxn][maxn], rk[maxn], ans[maxn], pos[maxn], n = 0;

int ask(int x, int y) {
    if (f[x][y] != -1)
        return f[x][y];
    printf("? %d %d\n", x, y);
    fflush(stdout);
    scanf("%d", &f[x][y]);
    return f[x][y];
}

int ask_local(int x, int y) {
    if (f[x][y] != -1)
        return f[x][y];
    if (y == x + 1)
        return pos[x] > pos[y];
    return f[x][y] = ((ask_local(x + 1, y) + ask_local(x, y - 1) - ask_local(x + 1, y - 1) + (pos[x] > pos[y]) + 8) & 1);
}

int query(int x, int y) {
    if (y == x + 1)
        return ask(x, y);
    return (ask(x, y) - ask_local(x, y - 1) - ask(x + 1, y) + ask_local(x + 1, y - 1) + 8) & 1;
}

int get_pos(int x) {
    int l = 1, r = rk[0], ans = 1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (query(rk[mid], x))
            r = mid - 1;
        else
            l = mid + 1, ans = l;
    }
    return ans;
}

int main() {
    memset(f, -1, sizeof(f));
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        f[i][i] = 0;
    rk[0] = rk[1] = 1;
    for (int i = 2; i <= n; ++i) {
        int p = get_pos(i);
        for (int j = rk[0]; j >= p; --j)
            rk[j + 1] = rk[j], ++pos[rk[j]];
        rk[p] = i, ++rk[0], pos[rk[p]] = i;
    }
    for (int i = 1; i <= n; ++i)
        ans[rk[i]] = i;
    putchar('!');
    for (int i = 1; i <= n; ++i)
        printf(" %d", ans[i]);
    return 0;
}