#include <bits/stdc++.h>
#define MISAKA main
#define ll long long
using namespace std;
inline int read(){
   char ch=getchar();int f=1,x=0;
   while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
   while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
   return x*f;
}
const double eps=1e-9;
const int N=1e3+10,inf=1e9,mod=998244353;
int n,a[N],fa[N],len[N],ed=1,cnt=1,num=1,f[N][N],mx=1;
unordered_map<int,int> ch[N];
void insert(int c){
    int p=ed,np=++cnt;len[np]=len[p]+1;ed=np;
    for(;p&&!ch[p][c];p=fa[p]) ch[p][c]=np;
    if(!p) fa[np]=1;
    else{
        int q=ch[p][c];
        if(len[q]==len[p]+1) fa[np]=q;
        else{
            int nq=++cnt;fa[nq]=fa[q];len[nq]=len[p]+1;
            ch[nq]=ch[q];fa[q]=fa[np]=nq;
            for(;p&&ch[p][c]==q;p=fa[p]) ch[p][c]=nq;
        }
    }
}
int ask(int l,int r){cout<<"? "<<l<<' '<<r<<'\n'<<flush;return read();}
mt19937 rd(time(0));
signed MISAKA(){
    n=read();a[1]=f[1][1]=1;
    for(int i=2;i<=n;i++){
        if(ask(1,i)-f[1][i-1]==i) a[i]=++num;
        else{
            int l=1,r=i-1;
            while(r>=l){
                int mid=l+r>>1;
                if(ask(mid,i)-f[mid][i-1]==i-mid+1) r=mid-1;
                else l=mid+1;
            }
            a[i]=a[r];
        }
        for(int i=0;i<=cnt;i++) fa[i]=len[i]=0,ch[i].clear();
        int res=0;ed=cnt=1;
        for(int j=i;j>=1;j--) insert(a[j]),res+=len[ed]-len[fa[ed]],f[j][i]=res;
    }
    cout<<"! ";
    for(int i=1;i<=n;i++) cout<<a[i]<<' ';cout<<flush;
    return 0;
}