#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pl pair<ll, ll>
#define db double
#define vi vector<int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int N = 20005;

//vector<int> p = {2, 1, 7, 3, 4, 6, 5};

vector<int> a(N);

vector<vector<bool>> invs(N, vector<bool>(N));

int get(int l, int r)
{
    if (l>=r) return 0;
    return invs[l][r];
}

int ask(int l, int r)
{
    if (l>=r) return 0;
    cout<<"? "<<l+1<<' '<<r+1<<endl;
    int ans; cin>>ans;
    return ans;
    
    //int tmp = 0;
    //for (int i = l; i<=r; i++)
    //for (int j = i+1; j<=r; j++) if (p[i]>p[j]) tmp++;

    //cout<<tmp%2<<endl;

    //return tmp%2;

}

int cmp(int l, int r)
{
    int tmp = 0;
    tmp^=ask(l, r);
    tmp^=ask(l+1, r);
    tmp^=get(l, r-1);
    tmp^=get(l+1, r-1);

    return tmp;
}

void process(int n)
{
    //cout<<"Processing "<<n<<endl;

    vector<int> pos(n);
    for (int i = 0; i<n; i++) pos[a[i]] = i;

    //for (int i = 0; i<n; i++) cout<<a[i]<<' ';
    //cout<<endl;

    int L = 0;
    int R = n;
    while (R>L)
    {
        int mid = (L+R)/2;
        if (cmp(pos[mid], n)) R = mid;
        else L = mid+1;
    }

    a[n] = L;
    for (int i = 0; i<n; i++) if (a[i]>=L) a[i]++;

    int curinv = 0;
    for (int i = n-1; i>=0; i--)
    {
        if (a[i]>a[n]) curinv++;
        invs[i][n] = (invs[i][n-1]+curinv)%2;
    }
}

int main() {
    int n;
    cin>>n;

    a[0] = 0;
    for (int i = 1; i<n; i++) process(i);

    cout<<"! ";
    for (int i = 0; i<n; i++) cout<<a[i]+1<<' ';
    cout<<endl;

}