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

int n, a[maxn], tot;
int ans[maxn][maxn];

int query(int l, int r) {
    if(l > r) return 0;
    if(ans[l][r] != -1) return ans[l][r];
    cout << "? " << l << ' ' << r << endl;
    cin >> ans[l][r];
    return ans[l][r];
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    memset(ans, -1, sizeof(ans));
    cin >> n; a[1] = ++tot;
    rep(i, 2, n) {
        if(query(1, i) - query(1, i - 1) == i) {a[i] = ++tot; continue;}
        int l = 1, r = i, pos;
        while(l <= r) {
            int mid = l + r >> 1;
            if(query(mid, i) - query(mid, i - 1) == i - mid + 1) pos = mid - 1, r = mid - 1;
            else l = mid + 1;
        }
        a[i] = a[pos];
    }
    rep(i, 1, n) cout << a[i] << '\n';
    return 0;
}