# include <bits/stdc++.h>
# define maxn 1005
# define ull unsigned long long
# define rep(i, j, k) for(int i = j; i <= k; ++i)
using namespace std;

int n, tot;
int a[maxn], ans[maxn][maxn];
int d[maxn];
ull has[maxn], pw[maxn];
map<ull, int> mp;

inline int query(int l, int r) {
    if(ans[l][r]) return ans[l][r];
    cout << "? " << l << ' ' << r << endl;
    cin >> ans[l][r]; return ans[l][r];
}

void update(int r) {
    memset(d, 0, sizeof(d));
    rep(i, 1, r) {
        ull hsh = has[r] - has[i - 1] * pw[r - i + 1], len = r - i + 1;
        if(!mp.count(hsh)) d[1]++;
        else d[mp[hsh] - len + 2]++;
        d[i + 1]--; mp[hsh] = r;
    }
    rep(i, 1, r) d[i] += d[i - 1];
    rep(l, 1, r) ans[l][r] = ans[l][r - 1] + d[l];
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n; a[1] = ++tot; ans[1][1] = 1;
    pw[0] = 1; rep(i, 1, n) pw[i] = pw[i - 1] * 19260817;
    rep(i, 2, n) {
        int now = query(1, n);
        if(now - ans[1][i - 1] == i) a[i] = ++tot;
        else {
            int l = 1, r = i, pos, mid;
            while(l <= r) {
                mid = l + r >> 1;
                if(query(mid, i) - ans[mid][i - 1] == i - mid + 1) pos = mid - 1, r = mid - 1;
                else l = mid + 1;
            }
            a[i] = a[pos];
        }
        has[i] = has[i - 1] * 19260817 + a[i]; update(i);
    }
    cout << "! ";
    rep(i, 1, n) cout << a[i] << ' ';
    cout << '\n';
    return 0;
}