#include <bits/stdc++.h>
#define int long long
#define endl "\n"

using namespace std;
map<pair<int,int>,int>  mp;

int query(int l,int r){
    if(mp.count({l,r})) return mp[{l,r}];
    if(l==r)    return 0;
    cout<<"? "<<l<<" "<<r<<endl;
    int x;  cin>>x;
    mp[{l,r}]=x;
    return x;
}

bool cmp(int l,int r){
    int flag=0;
    if(l>r) swap(l,r),flag=1;
    //cout<<"cmp "<<l<<" "<<r<<endl;
    if(r==l+1)
        if(!flag)   return !query(l,r);
        else    return query(l,r);
    int ans=query(l,r)-query(l+1,r)-query(l,r-1)+query(l+1,r-1);
    if(flag)    return ans;
    return !ans;
}

void solve(){
    int n;  cin>>n;

    //sort
    vector<int> ans;    ans.push_back(1); 
    if(cmp(1,2))  
        ans.insert(ans.begin(),2);
    else    
        ans.push_back(2);   
    for(int i=3;i<=n;++i){
        //binary_search
        int l=0,r=ans.size()-1;
        while(l<r){
            int mid=(l+r)/2;
            //cout<<i<<" "<<ans[mid]<<endl;
            if(cmp(i,ans[mid])){
                r=mid;
            }else{
                l=mid+1;
            }
        }
        ans.insert(ans.begin()+l+1,i);
    }

    cout<<"! ";
    for(int i=0;i<n;i++){
        cout<<ans[i]<<" ";
    }
}

signed main(){
    ios::sync_with_stdio(0);
    int T=1;    //cin>>T;
    while(T--)  solve();
    return 0;
}