#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
// #define int long long
vector<vector<int>> dp(2020, vector<int>(2020, -1));
int ask(int l, int r)
{
    if (l > r)
    {
        return 0;
    }
    if (l == r)
    {
        return 0;
    }
    if (dp[l][r] != -1)
    {
        return dp[l][r];
    }
    else
    {
        cout << "? " << l + 1 << " " << r + 1 << endl;
        int x;
        cin >> x;
        return dp[l][r] = x;
    }
}

int solve()
{
    int n;
    cin >> n;
    vector<int> a;
    auto cal = [&](int x, int y) {
        return (((ask(x, y) + ask(x + 1, y - 1) - ask(x + 1, y) - ask(x, y - 1))) % 2 == 0);
    };
    vector<int> b(n);
    for (int i = 0; i < n; i++)
    {
        vector<int> pos(i + 1);
        if (a.empty())
        {
            a.emplace_back(i);
        }
        else
        {
            int l = 0, r = a.size() - 1;
            int ans = 0;
            while (l <= r)
            {
                int mid = l + r >> 1;
                if (cal(a[mid], i))
                {
                    l = mid + 1;
                }
                else
                {
                    ans = mid;
                    r = mid - 1;
                }
            }
            a.insert(a.begin() + l, i);
        }
        for (int j = 0; j <= i; j++)
        {
            pos[a[j]] = j;
        }
        for (int j = i - 1; j >= 0; j--)
        {
            dp[j][i] = dp[j][i - 1] + dp[j + 1][i] - dp[j + 1][i - 1] + (pos[j] > pos[i]);
            dp[j][i] &= 1;
            dp[j][i] = (dp[j][i] + 2) % 2;
        }
        // for (int j = 0; j <= i; j++)
        // {
        //     for (int k = 0; k <= i; k++)
        //     {
        //         cerr << dp[j][k] << " ";
        //     }
        //     cerr << endl;
        // }
    }
    int cnt = 1;
    cout << "! ";
    for (int i = 0; i < n; i++)
    {
        b[a[i]] = cnt++;
    }
    for (int i = 0; i < n; i++)
    {
        cout << b[i] << " \n"[i == n - 1];
    }
    return 0;
}
signed main()
{
    int test = 1;
    for (int i = 0; i <= 2000; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            dp[i][j] = 0;
        }
    }

    while (test--)
    {
        solve();
    }

    return 0;
}