#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a;i <= b;i++)
#define pre(i, a, b) for(int i = a;i >= b;i--)
#define pb push_back
const int N = 2e3 + 5;
int cnt = 0;
map<pair<int, int>, int>m;
int ask(int l, int r) {
    if (l >= r)return 0;
	//return 0;
    if (m.count({ l,r }))return m[{l, r}];
	cnt++;
	//return 0;
	cout << "? " << l << " " << r << "\n";
	
    int x;
    cin >> x;
   // cout << "\n";
    m[{l, r}] = x;
 	cout.flush();
    return x;
}
int get(int l, int r) {//得到l和r的大小关系 
    int x = (ask(l, r) - ask(l + 1, r) - ask(l, r - 1) + ask(l + 1, r - 1) + 4) % 2;
    return x;
}
int p[N];
int qq[N];
int f[N][N],g[N][N];
void solve(int l, int r) {
	
    if (l == r) {
        p[l] = l;
        return;
    }
    int mid = (l + r) / 2;
    solve(l, mid);
    solve(mid + 1, r);
    int x = mid, y = r;
    int len=r-l+1;
    vector<int>w;
    pre(i, r, l) {
        if (x >= l && y > mid)
        {
            if (get(p[x], p[y])) {
                w.pb(p[x]);
                x--;
            }
            else
            {
                w.pb(p[y]);
                y--;
            }
        }
        else if (x >= l) {
            w.pb(p[x]);
            x--;
        }
        else {
            w.pb(p[y]);
            y--;
        }
    }
    rep(i, 0, w.size() - 1) {
        p[r - i] = w[i];
    }
    rep(i,l,r){
		qq[p[i]]=i-l+1;
	}
	int now=0;
	rep(i,l,r){
		pre(j,i-1,l)
		{	
			if(qq[j]>qq[i])f[j][i]=1;
		}
	}
	rep(i,l,r){
		rep(j,i+1,r){
			g[i][j]=(f[i][j]+g[i][j-1]+g[i+1][j]-g[i+1][j-1])%2;
			m[{i,j}]=g[i][j];
		}
	}
}

int q[2005];
int main() {

    int t = 1;
    //cin>> t ;


    while (t--) {
        int n;
        cin >> n;
        solve(1, n);
        cout << "! ";
        rep(i, 1, n) {
            q[p[i]] = i;
        }
        rep(i, 1, n)cout << q[i] << " ";
    }
    //cout<<cnt<<endl;


    return 0;
}