#include <bits/stdc++.h>  
using namespace std;  

#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}];
    }
    cout << "? " << l << " " << r << endl;
    int res;
    cin >> res;
    mp[{l, r}] = res;
    return res;
}

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

    int n;
    cin >> n;

    vector<int> p {0, 1};
    vector<int> s(n + 1);
    for (int i = 2; i <= n; i++) {
        auto check = [&](int m) {
            int s1 = ask(m + 1, i), s2 = ask(m, i);
            if ((s1 + s[m]) % 2 != s2) {
                return true;
            }
            return false;
        };
        int l = 0, r = i;
        while (l + 1 != r) {
            int m = (l + r) / 2;
            if (check(p[m])) {
                r = m;
            } else {
                l = m;
            }
        }
        p.insert(p.begin() + r, i);
        for (int j = r + 1; j < p.size(); j++) {
            s[p[j]]++;
        }
        // cout << i << ":\n";
        // for (int j = 1; j < (int)p.size(); j++) {
        //     cout << p[j] << " ";
        // }
        // cout << endl;
    }

    vector<int> ans(n + 1);
    for (int i = 1; i <= n; i++) {
        ans[p[i]] = i;
    }

    cout << "! ";
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    cout << endl;

    return 0;
}