#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
using namespace std;
map<pair<int, int>, int>mp;
vector<int>ve;
int oooo = 0;
int aop[100000] = { 0 };
int ques(int l, int r)
{
    int s1;
    if (l == r)return 0;
    if (mp[{l, r}] != 0)
    {
        return mp[{l, r}] - 1;
    }
    else
    {
        cout << "? " << l << " " << r << endl;
        int op;
        cin >> op;
        mp[{l,r}] = op + 1;
        return op;
    }
}
bool check(int sub,int now)
{
    int s1;
    if (sub + 1 == now)
    {
        s1 = ques(sub, now);
    }
    else
    {
        s1 = ques(sub, now) ^ ques(sub + 1, now) ^ (aop[sub]&1) ^(aop[sub+1]&1);
        //cout << "???????????" << sub << " " << now << endl;
        //cout << ques(sub, now) << " " << ques(sub + 1, now) << " " << (aop[sub] & 1) << " " << (aop[sub + 1] & 1) << endl;
    }
    if (s1 == 1)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
int anwall[100000];
void solve()
{
    int n;
    cin >> n;
    ve.push_back(1);
    for (int i = 2; i <= n; i++)
    {
        int l = 0;
        int r = ve.size();
        int fl1 = 0, fl2 = 0;
        int anw;
        while (l < r)
        {
            int sub = (l + r) >> 1;
            if (check(ve[sub],i))
            {
                l = sub+1;
                fl1 = 1;
                anw = sub;
            }
            else
            {
                r = sub;
                fl2 = 1;
            }
        }
        if (fl1 == 0)
        {
            ve.insert(ve.begin(), i);
        }
        else if (fl2 == 0)
        {
            ve.push_back(i);
        }
        else
        {
            ve.insert(ve.begin() + anw + 1, i);
        }
        vector<int>onow(2001);
        for (int i = 0; i < ve.size(); i++)
        {
            onow[ve[i]] = i;
        }
        int of = ve.size();
        int sum = 0;
        for (int i = of; i >= 1; i--)
        {
            if (onow[of] < onow[i])
                sum++, aop[i] += sum;
            else aop[i] += sum;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        anwall[ve[i - 1]] = i;
    }
    cout << "! ";
    for (int i = 1; i <= n; i++)
    {
        cout << anwall[i] << " ";
    }
}
int main(void)
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    solve();
    return 0;
}