/*
* @Author: zxxzy
* @Date:   2023-06-26 23:15:27
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <bitset>
#include <set>
#include <cmath>
#include <vector>
#include <map>
//#define int long long
#define space ' '
// #define endl '\n'
#define de(x) cout<<"** "<<x<<" **"<<endl;
#define N 200005
using namespace std;
using ll=long long;
const int mod=998244353;
const int INF=0x3f3f3f3f;
const double eps=1e-6;

int pos[N],bin[N],tmp;
void pr(int l,int r){
    cout<<"? "<<l<<space<<r<<endl;
}
bool ch(int mid,int pos){
    if(pos==bin[mid]+1){
        pr(bin[mid],pos);
        cin>>tmp;
        return tmp;
    }
    int a,b,c,d;
    pr(bin[mid],pos);
    cin>>a;
    pr(bin[mid]+1,pos);
    cin>>b;
    pr(bin[mid]+1,pos-1);
    cin>>c;
    pr(bin[mid],pos-1);
    cin>>d;
    return a^b^c^d;
}
int bnrsch(int l,int r,int now){
    int mid;
    while(l+1<r){
        mid=(l+r)>>1;
        (ch(mid,now)?r:l)=mid;
    }
    return ch(r,now)?l:r;
}
signed main(){
    #ifdef LOCAL
        freopen("D:\\code2023\\test\\input.txt", "r", stdin);
        freopen("D:\\code2023\\test\\output.txt", "w", stdout);
    #endif
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    if(n==1){
        cout<<"! 1"<<endl;
    }else{
        pos[1]=1;
        bin[1]=1;
        pr(1,2);
        cin>>tmp;
        if(tmp){
            pos[1]=2;
            pos[2]=1;
            bin[1]=2;
            bin[2]=1;
        }else{
            bin[2]=2;
            pos[2]=2;
        }
        for(int i=3;i<=n;i++){
            int t=bnrsch(1,i-1,i);
            if(ch(t,i)){
                t=0;
            }
            for(int j=1;j<i;j++){
                if(pos[j]>=t){
                    pos[j]++;
                }
            }
            pos[i]=t+1;
            for(int j=1;j<=i;j++){
                bin[pos[i]]=i;
            }
        }
        cout<<"! ";
        for(int i=1;i<=n;i++){
            cout<<pos[i]<<space;
        }
    }

    return 0;
}