#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

const int N = 2010;

int n, m;
int a[N], ans[N];
int f[N][N];
int cnt = 1;
int tr[N];

int lowbit(int x) { return x & -x; }

int query(int k)
{
    int res = 0;
    for (; k; k -= lowbit(k))
        res += tr[k];
    return res;
}

void add(int k)
{
    for (; k < N; k += lowbit(k))
        tr[k]++;
}

int get(int l, int r)
{
    if (~f[l][r])
        return f[l][r];
    cout << "? " << l << ' ' << r << '\n';
    cout.flush();
    cin >> f[l][r];

    cnt++;
    assert(cnt < 40000);

    return f[l][r];
}

int calc(int l, int r)
{
    if (~f[l][r])
        return f[l][r];

    memset(tr, 0, sizeof tr);
    int res = 0;
    for (int i = l; i <= r; i++)
    {
        add(ans[i]);
        res += query(n) - query(ans[i]);
    }

    return f[l][r] = res % 2;
}

bool check(int l, int r)
{
    return get(l, r) - get(l + 1, r) - calc(l, r - 1) + calc(l + 1, r - 1);
}

void solve()
{
    cin >> n;
    if (n == 1)
    {
        cout << "! 1" << '\n';
        cout.flush();
        return;
    }

    memset(f, -1, sizeof f);
    for (int i = 1; i <= n; i++)
        f[i][i] = 0;

    a[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        int l = 0, r = i;
        while (l + 1 != r)
        {
            int mid = l + r >> 1;
            if (check(a[mid], i)) // a[mid] > i
                r = mid;
            else
                l = mid;
        }

        for (int j = i - 1; j > l; j--)
            a[j + 1] = a[j];
        a[l + 1] = i;

        for (int j = 1; j <= i; j++)
            ans[a[j]] = j;
    }

    for (int i = 1; i <= n; i++)
        ans[a[i]] = i;

    cout << "!";
    for (int i = 1; i <= n; i++)
        cout << ' ' << ans[i];
    cout.flush();
}

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

    solve();

    return 0;
}