#include<bits/stdc++.h>
#define RI register int
#define err puts("asd")
#define ll long long
#define ull unsigned long long
#define LL __int128
#define mk make_pair
#define fl fflush(stdout)
//#define int long long
using namespace std;

inline ll read(){
	ll s=0;register char c=getchar();bool f=0;
	while(c<'0'||c>'9'){if(c=='-') f=1;c=getchar();}
	while(c>='0'&&c<='9') s=(s<<3)+(s<<1)+c-48,c=getchar();
	return f?-s:s; 
}

const int N=2e3+5;

int n,a[N],f[N],cnt;
int A[N][N];

inline int Q(int x,int y){
	if(A[x][y]!=-1) return A[x][y];
	if(++cnt>40000) exit(1);
	cout<<"? "<<x<<' '<<y<<endl;fl;
	RI z=read();
	return A[x][y]=z;
}

inline void add(int x){while(x<=n) f[x]^=1,x+=x&-x;}

inline int ask(int x){RI ans=0;while(x) ans^=f[x],x^=x&-x;return ans;}

inline int get(int l,int r){
	RI tmp=0;
	for(RI i=r;i>=l;--i){
		tmp^=ask(a[i]);
		add(a[i]);
	}
	for(RI i=l;i<=r;++i) add(a[i]);
	return tmp;
}

signed main(){
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	n=read();
	memset(A,-1,sizeof A);
	RI x,y,z,l,r,mid,ans;
	for(RI i=1;i<=n;++i){
		l=1;r=i-1;ans=0;
		while(l<=r){
			mid=l+r>>1;
			if(Q(mid,i)^Q(mid+1,i)^get(mid+1,i-1)^get(mid,i-1)) r=mid-1;
			else l=mid+1,ans=mid;
		}
		//cout<<"debug "<<ans<<endl;
		for(RI j=1;j<i;++j)
			if(a[j]>ans) ++a[j];
		a[i]=ans+1;
	}
	cout<<"! ";
	for(RI i=1;i<=n;++i) cout<<a[i]<<' ';fl;
	return 0;
}