#include<bits/stdc++.h>
using namespace std;
int n;
bool mr[2005][2005];
int res[2005][2005];
inline int query(int x,int y){
//	assert(x<=n);assert(x>=1);
//	assert(y<=n);assert(y>=1);
	if(x==y)return 0;
	if(mr[x][y])return res[x][y];
	mr[x][y]=1;
	cout<<"? "<<x<<" "<<y<<endl;
	cin>>res[x][y];
	return res[x][y];
}
inline bool cmp(int i,int j){
	if(i+1==j)return !query(i,j);
	return !(query(i,j)^query(i+1,j)^query(i+1,j-1)^query(i,j-1));
}
int pos[2005],tot,tmp[2005];
int ans[2005],bl[2005];
int main(){
	ios::sync_with_stdio(0);
	cin>>n;
	pos[++tot]=1;bl[1]=1;
	for(int i=2;i<=n;i++){
		int L=1,R=tot,ans=0;
		while(L<=R){
			int mid=(L+R)/2;
			if(cmp(pos[mid],i)){
				ans=mid;
				L=mid+1;
			}
			else R=mid-1;
		}
		int tt=0;
		for(int j=ans+1;j<=tot;j++){
			tmp[++tt]=pos[j];
		}
		tot=ans;
		pos[++tot]=i;bl[i]=tot;
		for(int j=1;j<=tt;j++)pos[++tot]=tmp[j],bl[tmp[j]]=tot;
		for(int j=i-1;j>=1;j--){
			bool fl=0;
			if(bl[j]>bl[i])fl=1;
			fl=fl^res[j][i-1]^res[j+1][i-1];
			res[j][i]=res[j+1][i]^fl;
			mr[j][i]=1;
		}
	}
	cout<<"! ";
	for(int i=1;i<=n;i++)cout<<bl[i]<<" ";
}