#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 2010;

int n,p[MAXN],f[MAXN][MAXN];

int query(int l,int r){
	if(l>=r)return 0;
	cout<<"? "<<l<<" "<<r<<endl;
	int ret; cin>>ret;
	return ret;
}

int chk(int j,int i){ //check whether p[j] < p[i]
	int r = f[j+1][i-1] ^ f[j][i-1] ^ query(j+1,i) ^ query(j,i);
	return !r;
}

int main(){
	cin>>n;
	p[1] = 1;
	//

	rep(i,2,n){
		int L = 1,R = i-1,ret = 0;
		while(L<=R){
			int mid = (L+R)>>1,j = -1;
			rep(k,1,i-1)if(p[k]==mid){j=k;break;} assert(j!=-1);
			if(chk(j,i)){
				ret = mid;L = mid+1;
			}else{
				R = mid-1;
			}
		}
		p[i] = ret+1;
		rep(j,1,i-1)if(p[j] > ret)p[j]++;
		
		int sum = 0;
		per(j,i-1,1){
			sum += (p[j]>p[i]);
			f[j][i] = f[j][i-1]+sum;
		}
	}

	//
	cout<<"! "; rep(i,1,n)cout<<p[i]<<" ";cout<<endl;
    return 0;
}