#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
int a[1005];
const int maxn=1e3+5;
int b[maxn],rk[maxn],tp[maxn],cnt[maxn],sa[maxn],ht[maxn];
void Qsort(int n,int m) {
    for(int i=0;i<=m;++i) cnt[i]=0;
    for(int i=1;i<=n;++i) cnt[rk[i]]++;
    for(int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
    for(int i=n;i;--i) sa[cnt[rk[tp[i]]]--]=tp[i];
}
int calc(int l,int r){
    int n=r-l+1,m=1000;
    for(int i=1;i<=n;++i) rk[i]=b[i]=a[i+l-1],tp[i]=i;
    Qsort(n,1000);
    for(int w=1,p=0;p<n;w<<=1,m=p) {
        p=0;
        for(int i=1;i<=w;++i) tp[++p]=n-w+i;
        for(int i=1;i<=n;++i) if(sa[i]>w) tp[++p]=sa[i]-w;
        Qsort(n,1000);
        memcpy(tp,rk,sizeof(rk));
        rk[sa[1]]=p=1;
        for(int i=2;i<=n;++i) rk[sa[i]]=(tp[sa[i-1]]==tp[sa[i]]&&tp[sa[i-1]+w]==tp[sa[i]+w])?p:++p;
    }
    for(int i=1,k=0;i<=n;++i) {
        if(k) --k;
        while(b[i+k]==b[sa[rk[i]-1]+k]) ++k;
        ht[rk[i]]=k;
    }
    int ans=0;
    for(int i=1;i<=n;++i) ans+=n-sa[i]+1-ht[i];
    return ans;
}

bool query(int l,int r){
    cout<<"? "<<l<<" "<<r<<endl;
    int x;
    cin>>x;
    return x==calc(l,r);
}
void solve(){
    int n;
    cin>>n;
    a[1]=1;
    for(int i=2;i<=n;i++){
        int l=0,r=i-1;
		a[i]=i;
        while(l<r){
            int mid=l+r+1>>1;
            if(query(mid,i))r=mid-1;
            else l=mid;
        }
        if(l==0)a[i]=i;
        else a[i]=a[l];
    }
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    cout<<endl;
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}
/*

*/