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

#define int long long
#define F first 
#define S second
#define pb push_back

const int mol=998244353;

int ans1[1005][1005];
int cnt=0;

int get(int l, int r){
    if(l==r) return 1;
    if(ans1[l][r]==0){
        cout<<"? "<<l<<" "<<r<<endl;
        int iu;
        cin>>iu;
        ans1[l][r]=iu;
        return iu;
    }
    else return ans1[l][r];
}

void solve(){
    int n;
    cin>>n;
    bool ok=1;
    vector<int>ans(n+1);
    int iu=2;
    for(int i=1;i<=n;i++){
        if(i==1){
            ans[i]=1;
            continue;
        }
        if(get(1, i)-get(1, i-1)==i) {
            ans[i]=iu++;
            continue;
        }

        int l=1, r=i;
        for(int j=1;j<i;j++){
            if(r<j) break;
            if(ans1[j][i-1]){
                if(get(j, i) - get(j, i-1) == i-j+1) r=j;
                else l=j+1;
            }
        }
        
        while(l<r){
            int mid=l+r>>1;
            if(get(mid, i) - get(mid, i-1) == i-mid+1) r=mid;
            else l=mid+1;
        }
        if(l==1) ans[i]=iu++;
        else ans[i]=ans[l-1];
    }

    cout<<"! ";
    for(int i=1;i<=n;i++) cout<<ans[i]<<" ";cout<<endl;
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}