//qoj6303
//P9721
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<ctime>
#include<random>
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N=2010;
int n,a[N],b[N],f[N][N];
int ask(int x,int y){
	if(x>y)return 0;
	if(x==y)return 0;
	if(f[x][y]!=-1)return f[x][y];
	cout<<"? "<<x<<' '<<y<<endl;
	fflush(stdout);
	int res=read();
	return f[x][y]=res;
}
int query(int x,int y){
	if(x+1==y)
		return ask(x,y);
	int res=ask(x,y)^ask(x+1,y)^ask(x,y-1)^ask(x+1,y-1);
	return res;
}
int main()
{
	memset(f,-1,sizeof(f));
	n=read();
	for(int i=1;i<=n;i++)
		f[i][i]=0;
	for(int i=1;i<=n;i++)
		a[i]=i;
	for(int i=2;i<=n;i++){
		int l=1,r=i-1,p=i;
		while(l<=r){
			int mid=(l+r)>>1;
			if(query(a[mid],i)){
				p=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		for(int j=i;j>p;j--)
			a[j]=a[j-1];
		a[p]=i;
		int res=0;
		for(int j=1;j<=i;j++)
		b[a[j]]=j;
		for(int j=i-1;j>=1;j--){
			if(b[j]>b[i])res^=1;
			f[j][i]=res^f[j][i-1];
		}
	//	for(int j=1;j<=i;j++)cout<<b[j]<<' ';cout<<'\n';
	}
	cout<<"! ";
	for(int i=1;i<=n;i++)
		b[a[i]]=i;
	for(int i=1;i<=n;i++)
		cout<<b[i]<<' ';
	return 0;
}