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

void solve() {
    int n;
    cin >> n;

    vector _f(n + 1, vector<int>(n + 1, -1));
    int cnt = 0;
    auto f = [&](int l, int r) {
        if (l >= r) return 0;
        if (_f[l][r] != -1) return _f[l][r];
        cnt++;
        assert(cnt <= 40000);
        cout << "? " << l << " " << r << endl;
        int x;
        cin >> x;
        return _f[l][r] = x;
    };

    vector<int> a{1}, p(n + 1);
    for (int i = 2; i <= n; i++) {
        auto pos = lower_bound(a.begin(), a.end(), i, [&](int l, int r) {
            int x = f(l, r) - f(l + 1, r) - f(l, r - 1) + f(l + 1, r - 1);
            x = (x % 2 + 2) % 2;
            return !x;
        });
        a.insert(pos, i);
        for (int j = 0; j < a.size(); j++) p[a[j]] = j + 1;
        for (int l = i - 1, v = 0; l >= 1; l--) {
            if (p[l] > p[i]) v++;
            _f[l][i] = v;
        }
    }

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

int main() {
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) solve();
#ifdef DEBUG
    cout << "\n----------------\n";
    cout << fixed << setprecision(6);
    cout << "Times: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
#endif
}