#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
const int maxn=5005,bas=998244353;
int cha[maxn],s[maxn],n,cnt[maxn];
map<int,int>lst;
int qr(int l,int r){
    cout<<"? "<<l<<" "<<r<<"\n";
    cout.flush();
    int x;
    cin>>x;
    return x;
}
signed main(){
    cin>>n;
    cnt[1]=1,s[1]=1,lst[1]=1;
    for(int i=2;i<=n;i++){
        for(int j=1;j<=n;j++)cha[j]=0;
        int l=1,r=i-1,res=-1;
        while(l<=r){
            int mid=(l+r)>>1;
            if(qr(mid,i)==cnt[mid]+i-mid+1)r=mid-1,res=mid;
            else l=mid+1;
        }
        if(res!=-1)s[i]=s[res];
        else s[i]=i;
        int hsh=0;
        for(int j=i;j>=1;j--){
            hsh=hsh*bas+s[j];
            cha[lst[hsh]+1]++;
            cha[j+1]--;
            lst[hsh]=j;
        }
        for(int j=1;j<=i;j++)cha[i]+=cha[i-1],cnt[i]+=cha[i];
    }
    cout<<"!"<<"\n";
    for(int i=1;i<=n;i++)cout<<s[i]<<" ";
    return 0;
}