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

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

map<pair<int,int>,ll> mp;
ll ask(int l,int r) {
    if(mp.find({l,r})!=mp.end()) return mp[{l,r}];
    cout<<"? "<<l<<" "<<r<<endl;
    ll d;
    cin>>d;
    return mp[{l,r}]=d;
}
void solve() {
    cin>>n;
    vector<int> firstShow;
    firstShow.push_back(1);
    ll last=1;
    v[1]=1;
    for(int i=2;i<=n;i++) {
        if(ask(1,i)==last+i) firstShow.push_back(i),v[i]=1;
    }
    for(int i=2;i<=n;i++) {
        if(v[i]) continue;
        int l=0,r=firstShow.size()-1;
        int ans=-1;
        while(l<=r) {
            int mid=l+r>>1;
            int now=firstShow[mid];
            if(ask(now,i-1)+(i-1-now+1)+1==ask(now,i)) {
                r=mid-1;
            }
            else {
                ans=mid;//mid到i，i不是第一次出现
                l=mid+1;
            }
        }
        if(ans==-1) continue;
        sameTo[i]=firstShow[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();
}