#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
int dp[2005][2005];

int main(){

// #ifdef LOCAL
//     freopen("data.in", "r", stdin);
//     freopen("data.out", "w", stdout);
// #endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    memset(dp, -1, sizeof dp);

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

    auto ask = [&](int l, int r){
        if (l >= r) return 0;
        if (dp[l][r] != -1) return dp[l][r];
        cout << "? " << l + 1 << ' ' << r + 1 << endl;
        int t;
        cin >> t;
        return dp[l][r] = t;
    };

    for(int i = 1; i < n; i++){

        auto check = [&](int a, int b){
            if (a < b){
                int c1 = ask(a, b);
                int c2 = ask(a + 1, b);
                int c3 = ask(a, b - 1);
                int c4 = ask(a + 1, b - 1);
                return c1 ^ c2 ^ c3 ^ c4;
            }
            swap(a, b);
            int c1 = ask(a, b);
            int c2 = ask(a + 1, b);
            int c3 = ask(a, b - 1);
            int c4 = ask(a + 1, b - 1);
            return c1 ^ c2 ^ c3 ^ c4 ^ 1;
        };

        int l = 0, r = i;
        while(l < r){
            int mid = (l + r) / 2;
            if (check(c[mid], i)) r = mid;
            else l = mid + 1; 
        }
        c.insert(c.begin() + r, i);
        vector<int> pos(c.size());
        for(int j = 0; j < c.size(); j++)
            pos[c[j]] = j;
        int s = 0;
        for(int j = i - 1; j >= 0; j--){
            s ^= (pos[j] > pos[i]);
            dp[j][i] = dp[j][i - 1] ^ s;
        }
    }
    vector<int> ans(n);
    for(int i = 0; i < c.size(); i++)
        ans[c[i]] = i;
    cout << "! ";
    for(auto x : ans) cout << x + 1 << ' ';
    cout << endl;

}