#include<bits/stdc++.h>
#define N 2010
using namespace std;
int n,p[N],sa[N];

bool ch(int x,int l){
	cout<<"? "<<sa[x]<<' '<<l<<endl;
	int a,b;
	cin>>a;
	cout<<"? "<<sa[x]+1<<' '<<l<<endl;
	cin>>b;
	int fz=0;
	for(int i=x+1;i<l;i++) if(p[i]<p[x]) fz^=1;
	if((a+b+fz)%2) return false;
	return true;
}

int main(){
	cin>>n;
	p[1]=1;
	sa[1]=1;
	for(int i=2;i<=n;i++){
		int l=0,r=i-1;
		while(l<r){
			int mid=(l+r+1)/2;
			if(ch(mid,i)) l=mid;
			else r=mid-1;
		}
		for(int j=1;j<=i-1;j++) if(p[j]>l) p[j]++;
		p[i]=l+1;
		memset(sa,0,sizeof sa);
		for(int j=1;j<=i;j++) sa[p[j]]=j;
	}
	cout<<"! ";
	for(int i=1;i<=n;i++) cout<<p[i]<<' ';
	cout<<endl;
	return 0;
}