#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 ans[N];

int Q[N][N], query_cnt = 0;
int _query(int l, int r){
    query_cnt++;
#ifndef LOCAL
    cout << "? " << l << ' ' << r << endl;
    bool res; cin >> res;
#else
    bool res = 0;
    for(int i = l; i <= r; i++){
        for(int j = i + 1; j <= r; j++){
            res ^= ans[i] > ans[j];
        }
    }
    return res;
#endif
    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]?
    if(l == r) return false;
    // 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);
#ifdef LOCAL
    for(int i = 1; i <= n; i++){
        cout << a[i] << ' ';
    }
    cout << endl;
    for(int i = 1; i <= n; i++){
        cout << ans[i] << ' ';
    }
    cout << endl;
    for(int i = 1; i <= n; i++){
        assert(a[i] == ans[i]);
    }
#endif
    cout << "! ";
    for(int i = 1; i <= n - 1; i++) cout << a[i] << ' ';
    cout << a[n] << endl;
#ifdef LOCAL
    cout << "query count = " << query_cnt << endl;
#endif
}

bool ps[N][N];
void solve(){
    mt19937 rng(42);
    cin >> n;
#ifdef LOCAL
    for(int i = 1; i <= n; i++) ans[i] = i;
    shuffle(ans + 1, ans + n + 1, rng);
    // for(int i = 1; i <= n; i++) cin >> ans[i];
#endif
    forn(i, n + 1) forn(j, n + 1) Q[i][j] = -1;
    
    vector<int> a(n + 1), ai(n + 1);
    for(int i = 1; i <= n; i++){
        ai[i] = a[i] = i;
    }

    for(int i = 2; i <= n; i++){
        int lo = 0, hi = i - 1;
        while(lo != hi){
            int mid = (lo + hi + 1) / 2;
            // if(query2(ai[mid], i)){
            if(query(ai[mid], i) ^ query(ai[mid] + 1, i) ^ ps[ai[mid]][i - 1] ^ ps[ai[mid] + 1][i - 1]){
                hi = mid - 1;
            }else{
                lo = mid;
            }
        }

        for(int j = 1; j < i; j++){
            if(a[j] > lo) ++a[j];
        }
        a[i] = lo + 1;

        for(int j = i - 1; j >= 1; j--){
            ps[j][i] = ps[j][i - 1];
            ps[j][i] ^= a[j] > a[i];
            ps[j][i] ^= ps[j + 1][i];
            ps[j][i] ^= ps[j + 1][i - 1];
        }

        for(int j = 1; j <= i; j++){
            ai[a[j]] = j;
        }
    }

    answer(a);
}

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