#include<iostream>
#include<cstring>
#include<vector>
#include<random>
#include<algorithm>
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);

    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;
    };
    vector<int> id(n);
    for(int i = 0; i < n; i++) id[i] = 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;
    };

    stable_sort(id.begin(), id.end(), [&](int x, int y){
        return !check(x, y);
    });

    vector<int> ans(n);
    for(int i = 0; i < n; i++)
        ans[id[i]] = i;
    cout << "! ";
    for(auto x : ans) cout << x + 1 << ' ';
    cout << endl;

}