#include<bits/stdc++.h>
#define p_b push_back
#define m_p make_pair
#define pii pair<int,int>
#define mid ((l+r)>>1) 
#define ls k<<1
#define rs k<<1|1
#define int long long
#define ull unsigned long long
using namespace std;
inline int rd(){
	int x=0,f=1; char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())if (ch=='-') f=-1;
	for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
const int N=1000+5,INF=0x3f3f3f3f3f3f3f3f;
const ull p=13331;
int a[N],n,tot;
map<ull,int> mp;
int c[N],sum[N];

signed main(){
	n=rd();
	sum[1]=a[1]=++tot,mp[1]=1;
	for(int i=2;i<=n;i++){
		int tmp,l=1,r=i,p=1;
		while(l<=r){
			printf("? %lld %lld\n",mid,i);fflush(stdout);
			tmp=rd();
			if(tmp==sum[mid]+mid-i+1){
				p=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		if(p==1) a[i]=++tot;
		else a[i]=a[p-1];
		
		memset(c,0,sizeof(c));
		ull Hash=0;
		for(int j=i;j>=1;j--){
			Hash=Hash*p+a[j];
			c[mp[Hash]+1]++,c[j+1]--;
			mp[Hash]=j;
		}
		for(int j=1;j<=i;j++) c[j]+=c[j-1],sum[j]+=c[j];
	}
	printf("! ");
	for(int i=1;i<=n;i++) printf("%lld ",a[i]);
	fflush(stdout);
	return 0;	
}