#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
constexpr int mod = 998244353;
constexpr int N = 1e6 + 10;

int query(int l, int r) {
    cout << "? " << l << ' ' << r << endl;
    int x; cin >> x;
    return x;
}
void solve() {
    int n;
    cin >> n;
    if (n == 1) {
        cout << "! 1" << endl;
        return;
    }
    vector<int> pos(n + 1), rev(n + 1);
    iota(pos.begin(), pos.end(), 0);
    auto check = [&](int mid, int id) -> bool { // 检查 p[id] 是否小于 p[pos[mid]]
        if (id == pos[mid] + 1) {
            return query(pos[mid], id);
        } else {
            return query(pos[mid], id) ^ query(pos[mid] + 1, id) ^ rev[pos[mid]];
        }
    };
    for (int i = 2; i <= n; i++) {
        int l = 1, r = i - 1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (check(mid, i)) r = mid - 1;
            else l = mid + 1;
        }
        for (int j = i - 1; j >= l; j--) {
            rev[pos[j]] ^= 1;
            pos[j + 1] = pos[j];
        }
        pos[l] = i;
    }
    vector<int> p(n + 1);
    for (int i = 1; i <= n; i++) p[pos[i]] = i;
    cout << '!';
    for (int i = 1; i <= n; i++) cout << ' ' << p[i];
    cout << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tt = 1;
    // cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}