#include<bits/stdc++.h>
using namespace std;
const int N=2010;
int via[N][N];
__inline int ask(int l,int r)
{
    if(l==r)return 0;
    if(l>r) return 0;
    if(via[l][r]!=-1)return via[l][r];
    printf("? %d %d\n",l,r);fflush(stdout);
    scanf("%d",&via[l][r]);return via[l][r];
}
__inline int cmp(int x,int y)
//ask if p_i>p_j
{
    int op=0;if(x>y)swap(x,y),op=1;
    return (ask(x,y)+ask(x+1,y-1)-ask(x,y-1)-ask(x+1,y)+10+op)%2;
}
int p[N],ip[N];
int main()
{
    int n;
    memset(via,-1,sizeof via);
    scanf("%d",&n);
    p[1]=1;
    for(int i=2;i<=n;++i)
    {
        // cerr<<"SOLVED : ";
        // for(int j=1;j<i;++j)cerr<<p[j]<<"_";cerr<<endl;
        for(int j=1;j<i;++j)ip[p[j]]=j;
        int u=(ask(1,i)-ask(1,i-1)+2)%2;
        vector<int>mb;
        // cerr<<"DELTA="<<u<<endl;
        for(int j=1;j<i;++j)if((i-j&1)==u)mb.push_back(ip[j]);
        //mb: greater than j
        int l=0,r=(int)mb.size()-1,ans=mb.size();
        // for(int i:mb)cerr<<i<<",";cerr<<endl;
        while(l<=r)
        {
            int mid=l+r>>1;
            // cerr<<"TRY : "<<mb[mid]<<endl;
            if(cmp(mb[mid],i))//p_{mb_mid}>p_i
            {
                // cerr<<"SUC,LESS\n";
                ans=mid,r=mid-1;
            }
            else
                // cerr<<"FAI,GREATER\n", 
                l=mid+1;
        }
        // cerr<<"ENDIN :  "<<ans<<endl;
        if(ans==mb.size())
        {
            p[i]=i;
        }
        else
        {
            int pos=mb[ans],w=p[pos];
            // cerr<<"END IN : "<<pos<<endl;
            for(int j=1;j<i;++j)if(p[j]>=w)++p[j];
            p[i]=w;
        }
    }
    printf("!");
    for(int i=1;i<=n;++i)printf(" %d",p[i]);puts("");
    return 0;
}