#pragma GCC optimize(2)

#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;
int f[MAXN][MAXN],p[MAXN];

int qry(int L,int R){
	cout<<"? "<<L<<" "<<R<<endl;
	int ret;cin>>ret;
	return ret;
}

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,pos=-1;
			rep(j,1,i-1)if(p[j]==mid){pos=j;break;}
			assert(pos>0);

			int val = qry(pos,i) ^ qry(pos+1,i) ^ f[pos][i-1] ^ f[pos+1][i-1];
			if(!val)ret=mid,L=mid+1;
			else R=mid-1;
		}
		ret++;
		p[i] = ret;
		rep(j,1,i-1)if(p[j] >= ret)p[j]++;

		int cnt=0;
		per(j,i-1,1){
			cnt ^= (p[j] > p[i]);
			f[j][i] = f[j][i-1] ^ cnt;
		}
	}

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

    return 0;
}