#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][N], b[N], c[N];
int ask(int l, int r) {
    if (~a[l][r]) return a[l][r];
    printf("? %d %d\n", l, r); fflush(stdout);
    return a[l][r] = read();
}
void Solve() {
    n = read();
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[i][j] = -1;
    for (int i = 1; i <= n; i++) a[i][i - 1] = 0;
    int tot = 0;
    c[1] = 1;
    for (int i = 2; c[i - 1] <= n; i++) c[i] = c[i - 1] << 1;
    for (int i = 1, j = 0, k; i <= n; i++) {
        while (c[j + 1] < i) j++; k = j;
        while (k && ask(c[k], i) - ask(c[k], i - 1) == i - c[k] + 1) k--;
        if (!k) {b[i] = ++tot; continue;}
        int L = c[k], R = min(i, c[k + 1]) - 1;
        while (L < R) {
            int mid = L + R + 1 >> 1;
            if (ask(mid, i) - ask(mid, i - 1) == i - mid + 1) L = mid;
            else R = mid - 1;
        }
        b[i] = b[L];
    }
    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;
}