#include <bits/stdc++.h>
using namespace std;
#define forw(_,l,r) for(auto _=(l);_<(r);++_)
#define fors(_,r,l) for(auto _=(r);_>(l);--_)
#define RN return

typedef long long ll;
typedef vector<int> vi;
unordered_map<int,char> mp;
int cnt=0;

char ask(int l,int r){
    if(l>=r)RN 0;
    int idx=l*65536+r;
    if(l<r && mp.find(idx)==mp.end()){
        cout<<"? "<<l<<' '<<r<<'\n';
        cout.flush();
        int ret;
        cin>>ret;
        RN mp[idx]=ret;
    }
    else RN mp[idx];
}

int comp(int i,int j){
    RN ask(i,j)^ask(i+1,j)^ask(i,j-1)^ask(i+1,j-1);
}

const int NUM=2010;
int arr[NUM]={};
vi merge(int l,int r){
    // cout<<"----"<<l<<' '<<r<<endl;
    if(r<l)assert(0);
    if(r-l==0)RN {l};
    if(r-l==1){
        if(ask(l,r))RN {r,l};
        else RN {l,r};
    }
    int m=(l+r)/2;
    auto v1=merge(l,m),v2=merge(m+1,r);
    int pt1=0,pt2=0,s1=v1.size(),s2=v2.size();
    vi ret;
    while(1){
        // cout<<"why";
        if(pt1>=s1||pt2>=s2)break;
        if(comp(v1[pt1],v2[pt2])){
            ret.push_back(v2.at(pt2));
            ++pt2;
        }
        else{
            ret.push_back(v1.at(pt1));
            ++pt1;
        }
        // cout<<"pt"<<pt1<<' '<<pt2<<endl;
    }
    while(pt1<s1)ret.push_back(v1[pt1++]);
    while(pt2<s2)ret.push_back(v2[pt2++]);
    RN ret;
}

int main()
{
    int n; cin>>n;
    vi ans=merge(1,n);
    // for(auto a:ans)cout<<a<<' ';
    // RN 0;
    forw(i,0,n)arr[ans[i]]=i+1;
    cout<<"! ";
    forw(i,0,n)cout<<arr[i+1]<<' ';
    return 0;
}