#include<bits/stdc++.h>
#define MAXN 500010
#define INF 1000000010
#define MOD 998244353
#define LL long long
#define LLL __int128_t
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
int a[MAXN],p[MAXN];
int ans[MAXN];
int nowr;
int ask(int x,int y){
	if (x==y) return 0;
	if (y<nowr) return ans[x];
	cout<<"? "<<x<<" "<<y<<endl;
	int ans;cin>>ans;
	return ans;
}
bool check(int x,int y){ // a[x]>a[y]
	assert(x<y);
	if (x==y-1) return ask(x,y);
	return (ask(x,y)^ask(x+1,y)^ask(x,y-1)^ask(x+1,y-1));
}
void Main(){
	int n;cin>>n;
	a[1]=1,p[1]=1,ans[1]=0;
	For(i,2,n){
		nowr=i;
		int l=1,r=i-1,answer=0;
		while (l<=r){
			int mid=l+r>>1;
			if (check(p[mid],i)){
				r=mid-1;
			}else{
				answer=mid;
				l=mid+1;
			}
		}
		For(j,1,i){
			if (a[j]>answer){
				a[j]++;
				p[a[j]]=j;
				ans[j]^=1;
			}
		}
		a[i]=answer+1;
		p[answer+1]=i;
	}
	cout<<"!";
	For(i,1,n) cout<<" "<<a[i];
	cout<<endl;
}
int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int T=1;/* cin>>T; */
	while (T--) Main();
}