#include<bits/stdc++.h>
#define ll long long

using namespace std;

int ask(int l, int r)
{
    if (l >= r)return 0;
    cout << "? " << l << ' ' << r << endl;
    int res; cin >> res;
    return res;
}
const int N = 2e3 + 10;

int dp[N][N], n, a[N], ans[N];

bool check(int x, int y)//y是否<x
{
    int t = dp[x + 1][y - 1];
    int a = dp[x][y - 1] - t, b = ask(x + 1, y) - t;
    int res = ask(x, y) - a - b - t;
    res = (res % 2 + 2) % 2;
    return res;
}

void solve()
{
    cin >> n;
    a[1] = 1, ans[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        int l = 1, r = i;//二分查找放到哪个后面
        while (l < r)
        {
            int mid = l + r >> 1;
            if (check(a[mid], i))r = mid;
            else l = mid + 1;
        }
        for (int j = i - 1; j >= r; j--)
        {
            a[j + 1] = a[j];
            ans[a[j]] = j + 1;
        }
        a[r] = i, ans[i] = r;
        int cnt = 0;
        for (int j = i - 1; j; j--)
        {
            cnt += (ans[j] > ans[i]);
            dp[j][i] = dp[j][i - 1] + cnt;
        }
    }
    cout << "! ";
    for (int i = 1; i <= n; i++)cout << ans[i] << ' ';
    cout << endl;
}

int main()
{
    int t = 1;
    while (t--)solve();
    return 0;
}