/******************************************************************************

Welcome to GDB Online.
  GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby, 
  C#, OCaml, VB, Perl, Swift, Prolog, Javascript, Pascal, COBOL, HTML, CSS, JS
  Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
const int N=2e3+10;

map<pii,int>mp;
int ask(int l,int r){
    if(l==r) return 0;
    if(mp.count({l,r})!=0) return mp[{l,r}];
    cout<<'?'<<' '<<l+1<<' '<<r+1<<'\n';
    cout.flush();
    int x;cin>>x;
    mp[{l,r}]=x;
    return x;
}

int f[N][N]; //inversions of [l,r]
int ask2(int l,int r){
    int x=ask(l,r);
    int y=ask(l+1,r);
    int a=f[l][r-1];
    int b=f[l+1][r-1];
    int d=x^y^a^b;
    return d;
}

void solve(){
    int n;cin>>n;
    
    vector<int>a(n),pos(n);
    a[0]=pos[0]=0;
    int p=1;
    while(p<n){
        auto check=[&](int m) -> bool {
            m=pos[m];
            int d=ask2(m,p);
            return d;
        };
        
        int l=-1,r=p;
        while(l+1<r){
            int m=l+r>>1;
            if(check(m)) r=m;
            else l=m;
        }
        
        for(int i=p-1;i>=r;i--){
            int cp=pos[i];
            a[cp]++;
            pos[a[cp]]=cp;
        }
        a[p]=r;
        pos[r]=p;
        
        int inv=0;
        for(int i=p-1;i>=0;i--){
            if(a[i]>a[p]) inv^=1;
            f[i][p]=f[i][p-1]^inv;
        }
        
        p++;
    }
    
    cout<<'!'<<' ';
    for(int i=0;i<n;i++){
        cout<<a[i]+1<<' ';
    }
    cout<<'\n';
}

signed main()
{
    solve();
    return 0;
}