#include <bits/stdc++.h>

using namespace std;

constexpr int N = 2000 + 9;

int a[N];
bool q[N][N];
int pos[N];

int query(int l, int r)
{
    ++l; ++r;
    cout << "? " << l << ' ' << r << endl;
    int res;
    cin >> res;
    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    a[0] = 0;
    for (int i = 1; i < n; ++i)
    {
        for (int j = 0; j < i; ++j)
        {
            pos[a[j]] = j;
        }
        int l = 0, r = i;
        while (l < r)
        {
            int mid = (l + r) / 2;
            int p = pos[mid];
            int cur = query(p, i) ^ query(p + 1, i) ^ q[p][i - 1] ^ q[p + 1][i - 1];
            if (cur)
            {
                r = mid;
            }
            else
            {
                l = mid + 1;
            }
        }
        for (int j = 0; j < i; ++j)
        {
            if (a[j] >= l)
                ++a[j];
        }
        a[i] = l;
        for (int j = i - 1, cnt = 0; j >= 0; --j)
        {
            cnt ^= a[j] > a[i];
            q[j][i] = q[j][i - 1] ^ cnt;
        }
    }
    cout << "!";
    for (int i = 0; i < n; ++i)
    {
        cout << ' ' << a[i] + 1;
    }
    cout << endl;
}