#include<bits/stdc++.h>
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define all(v) begin(v),end(v)
using namespace std;
using ll = long long;
bool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }

// const bool LOCAL = true;
const bool LOCAL = false;
vector<int> jp;

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void solve(){
    int n; cin >> n;
    if (LOCAL){
        jp.resize(n); iota(all(jp),0);
        mt19937 mt(-1);
        shuffle(all(jp),mt);
        cout << jp << endl;
    }
    // [l, r)
    auto ask = [&](int l, int r) -> int {
        if (r - l <= 1) return 0;
        if (LOCAL){
            int ret = 0;
            rep(i,l,r) rep(j,i+1,r){
                if (jp[i] > jp[j]) ret ^= 1;
            }
            return ret;
        }
        cout << "? " << l+1 << ' ' << r << endl;
        int ret; cin >> ret;
        return ret;
    };
    auto say = [&](vector<int> p){
        assert((int)(p.size()) == n);
        if (LOCAL){
            cout << p << endl;
            assert(p == jp);
        }
        cout << "!";
        rep(i,0,n){
            cout << ' ' << p[i]+1;
        }
        cout << endl;
    };
    vector<int> dp(n+1,0);
    // i th smallest is pos[i]
    vector<int> pos = {0};
    // value at i is p[i] th smallest
    vector<int> p = {0};
    rep(i,1,n){
        auto comp = [&](int val){
            int l = pos[val];
            int big = ask(l,i+1) ^ ask(l+1,i+1);
            big ^= dp[l] ^ dp[l+1];
            return big;
        };
        int le = 0, ri = i+1;
        while (ri - le > 1){
            int md = (le + ri) / 2;
            if (comp(md-1) == 1){
                ri = md;
            }
            else {
                le = md;
            }
        }
        // insert le
        vector<int> npos(i+1);
        rep(j,0,le){
            npos[j] = pos[j];
        }
        npos[le] = i;
        rep(j,le,i){
            npos[j+1] = pos[j];
        }

        vector<int> np(i+1);
        rep(j,0,i+1){
            np[npos[j]] = j;
        }
        swap(pos,npos);
        swap(p,np);
        // update dp
        int add = 0;
        for (int j = i-1; j >= 0; j--){
            add ^= int(p[j] > p[i]);
            dp[j] ^= add;
        }
        // cout << p << endl;
        // cout << pos << endl;
        // cout << dp << endl;
        // cout << endl;
    }
    say(p);
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    solve();
}