#include <bits/stdc++.h>
using namespace std;
int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') {if (c == '-') f = -f; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
    return x * f;
}
const int N = 1005;
int n;
int a[N], b[N], c[N], d[N], nxt[N];
int ask(int l, int r) {
    printf("? %d %d\n", l, r);
    fflush(stdout); return read();
}
void Solve() {
    n = read();
    int tot = 0;
    for (int i = 1; i <= n; i++) {
        int L = 0, R = i - 1;
        while (L < R) {
            int mid = L + R + 1 >> 1;
            if (ask(mid, i) - a[mid] <= i - mid) L = mid;
            else R = mid - 1;
        }
        if (!L) b[i] = ++tot; else b[i] = b[L];
        for (int j = 1; j <= i; j++) c[j] = b[j], d[j] = 0;
        reverse(c + 1, c + i + 1);
        for (int k = 2, j = 0; k <= i; k++) {
            while (j && c[j + 1] != c[k]) j = nxt[j];
            if (c[j + 1] == c[k]) j++; nxt[k] = j;
        }
        for (int j = 2; j <= i; j++) if (nxt[j]) {
            d[nxt[j]]++;
            d[j]--;
        }
        for (int j = 1; j <= i; j++) d[j] += d[j - 1], a[i - j + 1] += d[j];
    }
    putchar('!');
    for (int i = 1; i <= n; i++) printf(" %d", b[i]); putchar('\n');
}
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    int _ = 1;
    while (_--) Solve();
    return 0;
}