#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
const int N = 2e3+10,mod = 998244353,INF=1e9+10;
const double eps = 1e-8;
typedef pair<int,int>PII;
typedef pair<int,PII>PIII;
int pos[N],a[N];
int query(int l,int r)
{
    printf("? %lld %lld\n",l,r);
    fflush(stdout);
    int x;
    cin>>x;
    return x;
}
bool check(int mid,int x)
{
    int cnt=0;
    for(int i=pos[mid]+1;i<x;i++)
        if(a[i]<mid)  cnt++;
    int ans = ((query(pos[mid],x)-query(pos[mid]+1,x)-cnt)%2+2)%2;
    return ans;
}
void solve()
{
    int n;
    cin>>n;
    if(n==1)
    {
        cout<<"! "<<1;
        puts("");
        fflush(stdout);
        return;
    }
    int t = query(1,2);
    if(t)
    {
        a[2]=1,pos[1]=2;
        a[1]=2,pos[2]=1;
    }
    else
    {
        a[1]=1,pos[1]=1;
        a[2]=2,pos[2]=2;
    }
    
    for(int i=3;i<=n;i++)
    {
        int l=1,r=i-1;
        while(l<r)
        {
            int mid = l+r>>1;
            if(check(mid,i))    r=mid;
            else    l=mid+1;
        }
        if(!check(l,i))l++;
        for(int j=i-1;j>=l;j--) a[pos[j]]++,pos[j+1]=pos[j];
        pos[l]=i,a[i]=l;
    }
    cout<<"!";
    for(int i=1;i<=n;i++)   cout<<" "<<a[i];
    puts("");
    fflush(stdout);
}
signed main()
{
    int T =1 ;
    while(T--)
    {
        solve();
    }
    return 0;
}