#include <bits/stdc++.h>

using namespace std;
using ll = long long;

class BIT {
    private:
        vector<int> bit;
        int N;

        int lsone(int x) {
           // cout << "lsone " << (x & (-x)) << endl;
            return (x & (-x));
        }
    public:
    
        BIT(int n) {
            N = n+10;
            bit.resize(n+10);
        }

        void add(int idx) {
            idx++;
            for(;idx < N; idx += lsone(idx)) {
                bit[idx] += 1;
            }
        }

        int query(int idx) {
            idx++;
            int ans = 0;
            for(;idx > 0; idx -= lsone(idx)) {
             //   cout << idx << " " << lsone(idx) << endl;
                ans += bit[idx];
            }
            return ans;
        }

};

vector<int> ans(1);

void add(int p) {
    vector<int> pos(p);
    for(int i = 0; i < p; i++) pos[i] = i;
    shuffle(pos.begin(), pos.end(), default_random_engine{});
    // cout << "pos: ";
    // for(auto v : pos) cout << v << " ";
    // cout << endl;
    vector<int> numinv(p+1);
    BIT bit(p + 1);
    // cout << "ans: ";
    // for(auto v : ans) cout << v << " ";
    // cout << endl;
    for(int i = p - 1; i >= 0; i--) {
        numinv[i] = numinv[i+1];
        numinv[i] += bit.query(ans[i]);
        bit.add(ans[i]);
    }

    // cout << "numinv: ";
    // for(auto v : numinv) cout << v << " ";
    // cout << endl;



    // sort randomly

    vector<int> cand(p+1, 1);
    int numcand = p+1;
    int cnt = 0;

    vector<int> curr(p+1);
    while(numcand > 1) {
        for(int i = pos[cnt]; i < p; i++) {
            curr[ans[i]] = 1;
        }
        cout << "? " << pos[cnt] + 1 << " " << p + 1 << endl;
        int r; cin >> r;

        bool elim = true;

        if(r == (numinv[pos[cnt]])% 2) {
            elim = false;
        }

        for(int i = p; i >= 0; i--) {
            if(curr[i]) elim = !elim;
            if(elim) {
                if(cand[i] == 1) {
                    cand[i] = 0; numcand--;
                }
            }
        }

        for(int i = pos[cnt]; i < p; i++) {
            curr[ans[i]] = 0;
        }

        cnt++;
    }

    int newpos = 0;
    for(int i = 0; i <= p; i++) {
        if(cand[i] == 1) newpos = i;
    }

    vector<int> nans(p+1);
    for(int i = 0; i < p; i++) {
        if(ans[i] < newpos) {
            nans[i] = ans[i];
        } else {
            nans[i] = ans[i] + 1;
        }
    }
    nans[p] = newpos;

    swap(ans, nans);
}

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

    int n; cin >> n;

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

    cout << "! ";
    for(auto x : ans) {
        cout << x + 1 << " ";
    }
    cout << endl;
}