int main() {}

#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

const int solve = []() {
    int n;
    cin >> n;
    
    vector<vector<int>> inversions(n + 1, vector<int>(n + 1, -1));
    for (int i = 1; i <= n; i++) inversions[i][i - 1] = inversions[i][i] = 0;
    auto ask = [&](int l, int r) -> int {
        if (~inversions[l][r]) { return inversions[l][r]; };
        cout << "? " << l << ' ' << r << endl;
        int ans;
        cin >> ans;
        return ans;
    };
    
    auto cmp = [&](int l, int r) -> int {
        if (l == 0) return true;
        return (ask(l, r) - ask(l + 1, r) - ask(l, r - 1) + ask(l + 1, r - 1)) % 2 == 0;
    };
    
    vector<int> seq{0}, ans;
    for (int i = 1; i <= n; i++) {
        int l = 0, r = seq.size() - 1;
        while (l < r) {
            int mid = l + r + 1 >> 1;
            if (cmp(seq[mid], i)) l = mid;
            else r = mid - 1;
        }
				seq.emplace(seq.begin() + l + 1, i);
        ans.resize(i + 1, 0);
        for (int j = 1; j <= i; j++) {
            ans[seq[j]] = j;
        }
        int greater = 0;
        for (int j = i - 1; j; j--) {
            greater += (ans[j] > ans[i]);
            inversions[j][i] = inversions[j][i - 1] + greater;
        }
    }
    cout << "! ";
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " \n"[i == n];
    }
    cout.flush();
    return 0;
}();