#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int n, p[N], f[N][N], g[N], s[N];

void modify(int x)
{
    for (; x <= n; x += x & -x) {
        ++s[x];
    }
    return;
}

int query(int x)
{
    int res = 0;
    for (; x; x -= x & -x) {
        res += s[x];
    }
    return res;
}

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

signed main()
{
    memset(f, -1, sizeof(f));
    scanf("%d", &n);
    p[1] = 1;
    for (int i = 2; i <= n; ++i) {
        int l = 1, r = i - 1, res = 0;
        while (l <= r) {
            int mid = (l + r) >> 1, wh = 0;
            for (int j = 1; j < i; ++j) {
                if (p[j] == mid) {
                    wh = j;
                    break;
                }
            }
            if (!(query(wh, i) ^ query(wh, i - 1) ^ query(wh + 1, i) ^ query(wh + 1, i - 1))) {
                res = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        p[i] = res + 1;
        for (int j = 1; j < i; ++j) {
            if (p[j] > res) {
                ++p[j];
            }
        }
        for (int j = 1; j <= n; ++j) {
            s[j] = 0;
        }
        modify(p[i]);
        for (int j = i - 1; j; --j) {
            g[j] = g[j + 1] + query(p[j]);
            modify(p[j]);
        }
    }
    printf("!");
    for (int i = 1; i <= n; ++i) {
        printf(" %d", p[i]);
    }
    return 0;
}