#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pis=pair<ll,ll>;

const int N=2e3+100;

int v[N],p[N],n,tmp[N],top,ans[N];

map<pis,int> mp;


int getinv(vector<int> &a){
    int m=a.size(),ret=0;
    for(int i=0;i<m;i++)tmp[a[i]]=i;
    for(int i=0;i<m;i++){
        if(tmp[i]==i)continue;
        swap(tmp[a[i]],tmp[i]);
        a[tmp[a[i]]]=a[i];
        ret^=1;
    }
    return ret;
}

int ask(int l,int r){
    if(mp.find({l,r})!=mp.end())return mp[{l,r}];
    cout<<"? "<<l<<" "<<r<<'\n';
    int ret=0;
    cin>>ret;
    return mp[{l,r}]=ret;
}

bool cmp(int p1,int p2){
    if(p1+1==p2){
        if(ask(p1,p2)==0)return 1;
        return 0;
    }
    int inv1=ask(p1,p2),inv2=ask(p1+1,p2),inv3,inv4;
    //p1+1 p2-1
    vector<int> vv;
    for(int i=1;i<=top;i++)if(v[i]>p1&&v[i]<p2)vv.push_back(v[i]-(p1+1));
    inv3=getinv(vv);
    

    //p1 p2-1
    vv={};
    for(int i=1;i<=top;i++)if(v[i]>=p1&&v[i]<p2)vv.push_back(v[i]-p1);
    inv4=getinv(vv);

    if((inv1+inv3-inv2-inv4+4)%2==0)return 1;
    return 0;

}

void solve(){
    cin>>n;
    v[++top]=1;p[1]=1;
    for(int i=2;i<=n;i++){
        int l=1,r=top;
        while(l<=r){
            int mid=(l+r)>>1;
            if(cmp(v[mid],i))l=mid+1;
            else r=mid-1;
        }
        //ins l
        top++;
        for(int j=top;j>l;j--){
            v[j]=v[j-1];
            p[v[j]]=j;
        }
        v[l]=i;
        p[i]=l;
    }
    for(int i=1;i<=n;i++)ans[v[i]]=i;
    cout<<"! ";
    for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
    cout<<'\n';
}

signed main(){
    int t_=1;
    // cin>>t_;
    
    while(t_--)solve();
}
/*
4
2 3 1 4 




2 4 1 3
3 4 1 2
3 4 2 1
*/