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

using i64 = long long;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    // [l, r]
    uniform_int_distribution<int> uni(l, r);
    return uni(rng);
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

#ifdef LOCAL
    // freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> ord{0};
        vector inv(n, vector<int>(n));

#ifdef LOCAL
        vector<int> p(n);
        vector f(n, vector<int>(n));
        iota(p.begin(), p.end(), 0);
        for (int i = 1; i < n; i++) {
            swap(p[i], p[rand(0, i - 1)]);
        }

        for (int i = 0; i < n; i++) {
            for (int j = i - 1, x = 0; j >= 0; j--) {
                f[j][i] = (x += p[j] > p[i]) + f[j][i - 1];
            }
        }
#endif

        int count = 0;

        for (int i = 1; i < n; i++) {
            auto ask = [&](int l, int r) {
                if (l != r && r == i) {
                    ++count;
                    cout << "? " << l + 1 << ' ' << r + 1 << endl;
                    int res;
#ifdef LOCAL
                    res = f[l][r] % 2;
#else
                    cin >> res;
#endif
                    return res;
                } else {
                    return inv[l][r] % 2;
                }
            };

            int low = 0, high = ord.size();
            while (low < high) {
                int mid = low + high >> 1;
                int j = ord[mid];
                if ((ask(j, i) ^ ask(j + 1, i) ^ ask(j, i - 1) ^ ask(j + 1, i - 1)) != 0) {
                    high = mid;
                } else {
                    low = mid + 1;
                }
            }

            for (int j = low; j < int(ord.size()); j++) {
                inv[ord[j]][i] = 1;
            }
            for (int j = i - 1; j >= 0; j--) {
                inv[j][i] += inv[j + 1][i];
            }
            for (int j = i - 1; j >= 0; j--) {
                inv[j][i] += inv[j][i - 1];
            }

            ord.insert(ord.begin() + low, i);
        }

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

        cout << '!';

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

#ifdef LOCAL
        assert(ans == p);
#endif
    };
    
    solve();
    
    return 0;
}