#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int rec[N][N];

int query(int l, int r) {
    if (rec[l][r] != -1) {
        return rec[l][r];
    }
    if (l == r) {
        return 0;
    }
    printf("? %d %d\n", l, r);
    fflush(stdout);

    int ret;
    scanf("%d", &ret);
    return rec[l][r] = ret;
}

int norm(int x) { return (x % 2 + 2) % 2; }

// 0:a[l]<a[r], 1:a[l]>a[r]

int p[N], ans[N];
int cnt;

int calcXy(int l, int r, int x) {
    int ret = 0;
    for (int i = l; i <= r; i++) {
        if (p[i] < x) {
            ret++;
        }
    }
    return ret;
}

int pd(int l, int r) {
    if (l + 1 == r) {
        return query(l, r);
    }
    int C = 0;
    int A = norm(calcXy(l + 1, r - 1, p[l]));
    int B = norm(query(l + 1, r) - query(l + 1, r - 1));
    return norm(query(l, r) - A - B - query(l + 1, r - 1));
}

int main() {
    memset(rec, -1, sizeof rec);
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        int l = 1, r = i - 1, ret = i;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (pd(p[mid], i)) {
                ret = mid;
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        for (int j = i; j > ret; j--) {
            p[j] = p[j - 1];
        }
        p[ret] = i;
    }
    for (int i = 1; i <= n; i++) {
        ans[p[i]] = i;
    }
    printf("!");
    for (int i = 1; i <= n; i++) {
        printf(" %d", ans[i]);
    }
    return 0;
}