# 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, a[maxn], tot;
int Hash1[maxn], d[maxn], pw[maxn];
int ans[maxn][maxn];
map<ull, int> mp;

namespace Garder {
    int ans[10][10];
    void init() {
        ans[1][1] = 1; ans[1][2] = 3, ans[1][3] = 6; ans[1][4] = 9; ans[1][5] = 12; ans[1][6] = 18; ans[1][7] = 24; ans[1][8] = 31;
        ans[2][2] = 1; ans[2][3] = 3; ans[2][4] = 5; ans[2][5] = 7; ans[2][6] = 12; ans[2][7] = 17; ans[2][8] = 24;
        ans[3][3] = 1; ans[3][4] = 3; ans[3][5] = 5; ans[3][6] = 9; ans[3][7] = 13; ans[3][8] = 19;
        ans[4][4] = 1; ans[4][5] = 3; ans[4][6] = 6; ans[4][7] = 9; ans[4][8] = 14;
        ans[5][5] = 1; ans[5][6] = 3; ans[5][7] = 6; ans[5][8] = 10;
        ans[6][6] = 1; ans[6][7] = 3; ans[6][8] = 6;
        ans[7][7] = 1; ans[7][8] = 3;
        ans[8][8] = 1;
    }
}

int query(int l, int r) {
    cout << "? " << l << ' ' << r << endl;
    // cout << Garder::ans[l][r] << endl;
    // ans[l][r] = Garder::ans[l][r];
    cin >> ans[l][r];
    return ans[l][r];
}

void update(int r) {
    Hash1[r] = Hash1[r - 1] * 19260817 + a[r];
    rep(i, 1, r) {
        int hsh = Hash1[r] - Hash1[i - 1] * pw[r - i + 1], l = mp[hsh], len = r - i + 1;
        // cerr << i << ' ' << r << ' ' << hsh << '\n';
        if(!l) d[1]++, d[i + 1]--;
        else d[l - len + 2]++, d[i + 1]--;
        mp[hsh] = r;
    }
    rep(i, 1, r) d[i] = d[i - 1] + d[i];//, cerr << d[i] << ' '; cerr << '\n';
    rep(i, 1, r) ans[i][r] = ans[i][r - 1] + d[i];//, cout << ans[i][r] << ' '; cout << '\n';
    memset(d, 0, sizeof(d));
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); Garder::init();
    // memset(ans, -1, sizeof(ans));
    cin >> n; a[1] = ++tot; Hash1[1] = 1;  ans[1][1] = 1; mp[1] = 1;
    pw[0] = 1; rep(i, 1, n) pw[i] = pw[i - 1] * 19260817;
    rep(i, 2, n) {
    	// rep(j, 1, i - 1) cout << ans[j][i - 1] << ' '; cout << '\n';
        if(query(1, i) - ans[1][i - 1] == i) {a[i] = ++tot; update(i); continue;}
        int l = 1, r = i, pos;
        while(l <= r) {
            int 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];
        update(i);
//        cout << "pos " << pos << ' ' << tot << '\n';
//        rep(j, 1, i) cout << a[i] << ' '; cout << '\n';
    }
    cout << "! ";
    rep(i, 1, n) cout << a[i] << ' ';
    return 0;
}