#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD=1e9+7;
const LL INF=1e9;
void rd(int &x)
{
    x=0; int fl=1; char c=getchar();
    while (!isdigit(c)) { if (c=='-') fl=-1;c=getchar(); }
    while (isdigit(c)) { x=(x<<1)+(x<<3)+(c^48);c=getchar(); }
    x*=fl;
    return;
}
int n,pos[2005],a[2005],rec[2005][2005];
int Query(int l,int r)
{
    if (l>=r) return 0;
    if (rec[l][r]!=-1) return rec[l][r];
    printf("? %d %d\n",l,r);
    fflush(stdout);
    scanf("%d",&rec[l][r]);
    return rec[l][r];
}
bool Compare(int mid,int i)
{
    int cnt=0;
    for (int k=pos[mid]+1;k<i;k++)
        if (mid>a[k]) cnt++;
    // cnt=Query(pos[mid],i-1)-Query(pos[mid]+1,i-1)
    return (Query(pos[mid],i)-Query(pos[mid]+1,i)-cnt%2+2)%2;
}
signed main()
{
    memset(rec,-1,sizeof rec);
    rd(n);
    a[1]=1; pos[1]=1;
    for (int i=2;i<=n;i++)
    {
        int L=0,R=i;
        while (L+1<R)
        {
            int mid=(L+R)/2;
            if (Compare(mid,i)) R=mid;
                else L=mid;
        }
        for (int j=i-1;j>=R;j--) a[pos[j]]++,pos[j+1]=pos[j];
        pos[R]=i,a[i]=R;
    }
    printf("! ");
    for (int i=1;i<=n;i++) printf("%d ",a[i]);
    printf("\n");
    return 0;
}
/*
3 1 2 4 5
*/