#include <bits/stdc++.h>

#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) (a).size()
#define forn(i, n) for(int i = 0; i < (n); i++)

using namespace std;

const int N = 2e3 + 11;
int Q[N][N], query_cnt = 0;
int _query(int l, int r){
    cout << "? " << l << ' ' << r << endl;
    bool res; cin >> res;
    return Q[l][r] = res;
}

int query(int l, int r){
    if(l == r) return 0;
    return Q[l][r] != -1 ? Q[l][r] : _query(l, r);
}

bool query2(int l, int r){ // a[l] > a[r]?
    assert(l != r);
    if(l > r) return !query2(r, l);
    if(l + 1 == r) return query(l, r);
    return query(l, r) ^ query(l + 1, r) ^ query(l, r - 1) ^ query(l + 1, r - 1);
}

int n; 
void answer(vector<int> a){
    assert(sz(a) == n + 1);
    cout << "! ";
    for(int i = 1; i <= n - 1; i++) cout << a[i] << ' ';
    cout << a[n] << endl;
}

vector<int> G[N];
void add_edge(int u, int v){
    G[u].push_back(v);
}

vector<int> tp;
bool vis[N];
void dfs(int v){
    vis[v] = true;
    for(auto u : G[v]){
        if(!vis[u]) dfs(u);
    }
    tp.push_back(v);
}

void solve(){
    cin >> n;
    forn(i, n + 1) forn(j, n + 1) Q[i][j] = -1;
    mt19937 rng(42);
    for(int tr = 0; tr < 10000; tr++){
        int u, v;
        do{
            u = rng() % n + 1, v = rng() % n + 1;
        }while(u == v);
        if(query2(u, v)){
            add_edge(v, u);
        }else{
            add_edge(u, v);
        }
    }

    vector<int> p(n + 1);
    for(int i = 1; i <= n; i++)
        if (!vis[i]) dfs(i);
    for(int i = 0; i < n; i++){
        p[tp[i]] = n - i;
    }
    answer(p);
}

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}