#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 2005;
int ans[N][N],a[N],id[N],n;
inline int rd()
{
    char c;int f = 1;
    while(!isdigit(c = getchar()))if(c=='-')f = -1;
    int x = c-'0';
    while(isdigit(c = getchar()))x = x*10+(c^48);
    return x*f;
}
bool query(int l,int r)
{
    if(l == r)return 0;
    if(~ans[l][r])return ans[l][r];
    cout << "? " << l << ' ' << r << endl;
    return ans[l][r] = rd();
}
bool check(int i,int x)
{
    bool b = 0;
    for(int j = id[x]+1;j < i;j++)b ^= x > a[j];
    return query(id[x],i) != query(id[x]+1,i)^b;
}
int main()
{
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    n = rd();memset(ans,-1,sizeof ans);
    for(int i = 1;i <= n;i++)
    {
        int l = 0,r = i-1;
        while(l < r)
        {
            int mid = l+r+1>>1;
            check(i,mid)?r = mid-1:l = mid;
        }
        a[i] = l+1;id[l+1] = i;
        for(int j = 1;j < i;j++)a[j] += a[j]>l,id[a[j]] = j;
        // cout << "asd " << i << ' '<< l+1 << endl;
        // for(int j = 1;j <= i;j++)cout << a[j] << " \n"[j==i];
    }
    cout << "! ";
    for(int i = 1;i <= n;i++)cout << a[i] << ' ';
    cout << endl;
    return 0;
}