#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int n;
int sameTo[10003];
int ans[10003];

map<pair<int,int>,int> mp;
int ask(int l,int r) {
    if(mp.find({l,r})!=mp.end()) return mp[{l,r}];
    cout<<"? "<<l<<" "<<r<<endl;
    int d;
    cin>>d;
    return mp[{l,r}]=d;
}
void solve() {
    cin>>n;
    for(int i=2;i<=n;i++) {
        int l=1,r=i-1;
        int ans=0;
        while(l<=r) {
            int mid=l+r>>1;
            if(ask(mid,i-1)+(i-1-mid+1)+1==ask(mid,i)) {
                r=mid-1;
            }
            else {
                ans=mid;//mid到i，i不是第一次出现
                l=mid+1;
            }
        }
        sameTo[i]=ans;
    }

    int c=0;
    for(int i=1;i<=n;i++) {
        if(sameTo[i]) ans[i]=ans[sameTo[i]];
        else ans[i]=++c;
    }

    cout<<"! ";
    for(int i=1;i<=n;i++) {
        cout<<ans[i]<<" ";
    }cout<<endl;
}
/*
1 2 3 3
*/
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int t=1;
    // cin>>t;
    while(t--)
    solve();
}