#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

map<pair<int, int>, int> memo;


//#define DEBUG

#ifdef DEBUG
vector<int> A;
#endif

int cnt = 0;

int query(int l, int r) {
    ++cnt;
    if (memo.count(make_pair(l, r)))
        return memo[make_pair(l, r)];
#ifdef DEBUG
    int x = 0;
    for (int i = l; i <= r; ++i) {
        for (int j = i + 1; j <= r; ++j) {
            if (A[i] > A[j])
                x ^= 1;
        }
    }
#else
    cout << '?' << ' ' << l + 1 << ' ' << r + 1 << endl;
    int x;
    cin >> x;
#endif

    memo[make_pair(l, r)] = x;
    return x;
}


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
#ifdef DEBUG
    A.resize(n);
    iota(A.begin(), A.end(), 0);
    random_shuffle(A.begin(), A.end());
#endif
    vector<int> pref_order(1, 0);
    for (int i = 1; i < n; ++i) {
        int left = -1, right = pref_order.size();
        while (right - left > 1) {
            int mid = (left + right) / 2;
            int j = pref_order[mid];
            int cur = query(j, i) ^ (j + 1 == i ? 0 : query(j + 1, i));
            for (int l = 0; l < mid; ++l) {
                if (pref_order[l] > j)
                    cur ^= 1;
            }
            if (cur)
                right = mid;
            else
                left = mid;
        }
        pref_order.insert(pref_order.begin() + right, i);
    }
    vector<int> ans(n);
    for (int i = 0; i < n; ++i)
        ans[pref_order[i]] = i;
    cout << '!';
    for (int i = 0; i < n; ++i)
        cout << ' ' << ans[i] + 1;
    cout << endl;

#ifdef DEBUG
    assert(ans == A);
#endif
    return 0;
}