#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int a[N], b[N], f[N][N];

int query(int l, int r)
{
    if (~f[l][r]) {
        return f[l][r];
    }
    if (l >= r) {
        return 0;
    }
    printf("? %d %d\n", l, r);
    int x;
	fflush(stdout);
    scanf("%d", &x);
    return f[l][r] = x;
}

int cmp(int l, int r)
{
    if (l > r) {
        return !cmp(r, l);
    }
    return query(l, r) ^ query(l + 1, r) ^ query(l, r - 1) ^ query(l + 1, r - 1);
}

signed main()
{
    int n;
    scanf("%d", &n);
    memset(f, -1, sizeof(f));
    for (int i = 1; i <= n; ++i) {
        a[i] = i;
    }
    stable_sort(a + 1, a + n + 1, cmp);
    for (int i = 1; i <= n; ++i) {
        b[a[i]] = n - i + 1;
    }
    printf("!");
    for (int i = 1; i <= n; ++i) {
        printf(" %d", b[i]);
    }
    puts("");
    return 0;
}