#include <bits/stdc++.h>
using namespace std;
const int N=1005;
int n,num,p[N][N],val[N],s[N];
int query(int l,int r) {
	printf("? %d %d\n",l,r);
	fflush(stdout);
	int x; cin>>x; return x;
}
int main() {
	cin>>n; s[1]=num=val[1]=1;
	for (int i=2; i<=n; i++) {
		int l=1,r=i-1,res=-1;
		while (l<=r) {
			int mid=(l+r)>>1;
			if (query(mid,i)==val[mid]+i-mid+1) r=mid-1;
			else res=mid,l=mid+1;
		}
		s[i]=(res==-1?(++num):s[res]);
		val[i]=1;
		for (int j=1; j<i; j++) {
			int len=p[j][i-1];
			while (len && s[i]!=s[j+len]) len=p[j][j+len-1];
			if (len || s[i]==s[j]) p[j][i]=len+1;
			val[j]+=(i-j+1-p[j][i]);
		}
//		cerr<<"!! "<<s[i]<<endl;
//		for (int j=1; j<=i; j++) printf("%d ",p[j][i]); puts("");
//		for (int j=1; j<=i; j++) printf("%d ",val[j]); puts("");
	}
	for (int i=1; i<=n; i++) printf("%d ",s[i]);
	return 0;
}