#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
// #define int long long
map<pair<int, int>, int> mp;
int ask(int l, int r)
{
    if (l == r)
    {
        return 0;
    }
    if (mp.count({l, r}))
    {
        return mp[{l, r}];
    }
    else
    {
        cout << "? " << l + 1 << " " << r + 1 << endl;
        int x;
        cin >> x;
        return mp[{l, r}] = x;
    }
}
int solve()
{
    int n;
    cin >> n;
    vector<int> a;
    auto cal = [&](int x, int y) {
        if (x < y)
        {
            if (x == y - 1)
            {
                return ask(x, y) == 0;
            }
            else
            {
                return (((ask(x, y) + ask(x + 1, y - 1) - ask(x + 1, y) - ask(x, y - 1))) % 2 == 0);
            }
        }
        else
        {
            swap(x, y);
            if (x == y - 1)
            {
                return ask(x, y) != 0;
            }
            else
            {
                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++)
    {
        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);
        }
    }
    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;
    while (test--)
    {
        solve();
    }

    return 0;
}