#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define ldb long double
#define pii pair<int,int>
#define mkp make_pair
#define mkt make_tuple
#define fr first
#define se second
#define uset unordered_set
#define umap unordered_map
#define pqueue priority_queue
#define all(_box) _box.begin(),_box.end()
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define clz __builtin_clz
#define lbd lower_bound
#define ubd upper_bound
#define deb(x) cerr<<#x<<'='<<(x)<<' '
using namespace std;
namespace HH{//string hashing only
    int mod[3]={999999797,int(1e9+97),int(1e9+297)};
    struct H{
        int x,y,z;

        H(){x=y=z=0;}
        H(int val){x=y=z=val;}
        H(int x,int y,int z):x(x),y(y),z(z){}
        friend H operator+(const H &u,const H &v){
            return H(
                (u.x+v.x)%mod[0],
                (u.y+v.y)%mod[1],
                (u.z+v.z)%mod[2]
            );
        }
        friend H operator-(const H &u){
            return H(
                mod[0]-u.x,
                mod[1]-u.y,
                mod[2]-u.z
            );
        }
        friend H operator-(const H &u,const H &v){
            return u+(-v);
        }
        friend H operator*(const int &u,const H &v){
            return H(
                1ll*u*v.x%mod[0],
                1ll*u*v.y%mod[1],
                1ll*u*v.z%mod[2]
            );
        }
        friend H operator*(const H &u,const H &v){
            return H(
                1ll*u.x*v.x%mod[0],
                1ll*u.y*v.y%mod[1],
                1ll*u.z*v.z%mod[2]
            );
        }
        friend bool operator==(const H &u,const H &v){
            return u.x==v.x&&u.y==v.y&&u.z==v.z;
        }
        friend bool operator!=(const H &u,const H &v){
            return !(u==v);
        }
        friend bool operator<(const H &u,const H &v){
            if(u.x!=v.x)return u.x<v.x;
            if(u.y!=v.y)return u.y<v.y;
            return u.z<v.z;
        }
    };
}
using HH::H;

const int base=19937;
const int N=1e3+4;
int n,cnt;
int f[N][N];
int a[N];
H sum[N];
map<H,int>mp;

int query(int l,int r){
    cout<<"? "<<l<<' '<<r<<endl;
    int res;
    cin>>res;
    return res;
}
bool check(int l,int r){
    return query(l,r)==f[l][r-1]+r-l+1;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        int x=0;
        for(int j=10;j>=0;j--){
            int y=x|(1<<j);
            if(y<i&&check(i-y,i))x=y;
        }
        if(i-x-1==0)a[i]=++cnt;
        else a[i]=a[i-x-1];
        
        sum[i]=base*sum[i-1]+H(a[i]);
        H pw(1);
        for(int j=i-1;j>=0;j--){
            pw=base*pw;
            H cur=sum[i]-sum[j]*pw;
            f[j][i]+=f[j+1][i];
            f[mp[cur]][i]--,mp[cur]=j+1;
        }
        for(int j=1;j<=i;j++)
            f[j][i]+=f[j][i-1]+i-j+1;
        
        // deb(i),cerr<<'\n';
        // for(int j=1;j<=i;j++)
        //     deb(j),deb(f[j][i]),cerr<<'\n';
    }
    cout<<"! ";
    for(int i=1;i<=n;i++)cout<<a[i]<<' ';
    cout<<endl;
}