#include<bits/stdc++.h>

using namespace std;

#define ll long long

int grid[2005][2005]={0};

int ask(int l,int r){
    cout<<"? "<<l+1<<" "<<r+1<<endl;
    int g = 0;
    cin>>g;
    return g;
}

int count(int l,int r){
    int sm = 0;
    for(int i =l;i<=r;i++)
        sm += grid[i][l];
    return sm%2;
}

void solve(){
    int n ;
    cin>>n;
    if(n==1){
        cout<<"! 1"<<endl;
        return;
    }
    vector<int> p(1,0);
    if(ask(0,1)){
        p = {1,0};
        grid[1][0] = 1;
    }else p = {0,1};

    for(int i = 2;i<n;i++){
        
        int l = -1, r = p.size();

        while(l+1!=r){
            int m = l+r>>1;
            vector<int> inv = {ask(p[m],i),count(p[m],i-1),ask(p[m]+1,i),count(p[m]+1,i-1)};
            int comp = inv[0] - inv[1] -inv[2]+inv[3];
            // cout<<"m:"<<m<<endl;
            // cout<<"invs:" << inv[0]<<" "<<inv[1]<<" "<<inv[2]<<" "<<inv[3]<<endl;
            comp = (comp%2+2)%2;
            if(comp)
            {
                r = m;
                // printf("comp=%d, r=%d\n",comp,r);
                // printf("pos %d > pos %d\n",p[m],i);
            }
            else
            {
                l =m;
                // printf("comp=%d, l=%d\n",comp,l);
                // printf("pos %d < pos %d\n",p[m],i);
            }
        }
        // printf("insert(%d,%d)\n",r,i);
        p.insert(p.begin()+r,i);
        
        vector<int> flg(n,0);
        for(int j = r+1;j<p.size();j++){
            flg[p[j]] = 1;
        }
        for(int j = i-1;j>=0;j--){
            grid[i][j] = grid[i][j+1] + flg[j];
        }
        // for(int x:p) cout<<x<<" ";
        // cout<<endl;

    }

    vector<int> ans(n,0);
    for(int i=0;i<n;i++){
        ans[p[i]] = i+1;
    }
    cout<<"! ";
    for(int x:ans) cout<<x<<" ";
    cout<<endl;

}


signed main(){
    // cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);
    int t = 1;
    // cin>>t;
    while(t--)
        solve();
}