#include<bits/stdc++.h>
using namespace std;
#define N 2005
int n,s[N][N],p[N],a[N];
int main(){
    scanf("%d",&n);
    p[1]=a[1]=1;
    for(int i=2;i<=n;++i){
        int l=1,r=i-1,mid,ans=0,w,x;
        while(l<=r){
            mid=(l+r)>>1;
            w=s[p[l]][i-1]^s[p[l]+1][i-1];
            printf("? %d %d\n",p[l],i);fflush(stdout);
            scanf("%d",&x);w^=x;
            printf("? %d %d\n",p[l]+1,i);fflush(stdout);
            scanf("%d",&x);w^=x;
            if(w==0)ans=mid,l=mid+1;
            else r=mid-1;
        }
        for(int j=i;j>ans+1;--j)p[j]=p[j-1];
        p[ans+1]=i;
        for(int j=1;j<=i;++j)a[p[j]]=j;
        for(int j=i-1;j;--j)s[j][i]=s[j+1][i]^s[j][i-1]^s[j+1][i-1]^(a[j]>a[i]);
    }
    printf("! ");
    for(int i=1;i<=n;++i)printf("%d ",a[i]);
    printf("\n");
    fflush(stdout);
    return 0;
}