#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(), _a.end()
const int N=2010;
int a[N],pos[N];
int vis[N][N];
int query(int l,int r){
    if(vis[l][r]!=-1)return vis[l][r];
    cout<<"? "<<l<<" "<<r<<endl,fflush(stdout);
    cin>>vis[l][r];
    return vis[l][r];
}
int ask(int l,int r){
    //cout<<l<<" "<<r<<endl;
    if(l+1==r)return query(l,r);
    return query(l+1,r-1)^query(l,r-1)^query(l+1,r)^query(l,r);
}
// void solve(){
  
// }
signed main(){
      int n;
    cin>>n;
    memset(vis,-1,sizeof vis);
    pos[1]=1;
    a[1]=1;
    vis[1][1]=0;
    for(int i=2;i<=n;i++){
        if(ask(pos[i-1],i)==0){
            pos[i]=i;
        }else{
            int l=1,r=i-1;
            while(l<r){
                int mid=l+r>>1;
                if(ask(pos[mid],i))r=mid;
                else l=mid+1;

            }
            for(int j=i;j>l;j--)pos[j]=pos[j-1];
            pos[l]=i;

        }
        for(int j=1;j<=i;j++)a[pos[j]]=j;
        int t=0;
        for(int j=i-1;j;j--){
            if(a[j]>a[i])t^=1;
            vis[j][i]=vis[j][i-1]^t;
        }
    }
    cout<<"! ";
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    return fflush(stdout),0;
}