#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int a[2005],p[2005],tot;
int query(int l,int r){
    if(l==r) return 0;
    tot++;
    assert(tot<=40000);
    printf("? %d %d\n",l,r);
    fflush(stdout);
    int t;
    scanf("%d",&t);
    return t;
}
int main() {
    int T = 1, kase = 0;
    //cin >> T;
    while (T--) {
        int n;
        cin>>n;
        a[1]=p[1]=1;
        for(int i=2;i<=n;i++){
            int l=0,r=i-1;
            while(l<r){
                int mid=(l+r+1)/2;
                if(query(p[mid],i)!=query(p[mid]+1,i)) r=mid-1;
                else l=mid;
            }
            for(int j=l+1;j<i;j++) a[p[j]]++;
            a[i]=l+1;
            for(int j=1;j<=i;j++) p[a[j]]=j;
        }
        printf("!");
        for(int i=1;i<=n;i++) printf(" %d",a[i]);
        puts("");
    }
    return 0;
}