#include<bits/stdc++.h>
using namespace std;

const int N=1005;
int n,a[N];

int s[N],sa[N],ht[N];
inline void init(){
	static pair<int,int> bl[N];
#define fi first
#define se second
#define mp make_pair
	static int rk[N];
	static auto grk=[&](){
		static int c[N],x[N],y[N];
		memset(c,0,n+1<<2);
		for(int i=1;i<=n;i++)c[bl[i].se]++;
		for(int i=1;i<=n;i++)c[i]+=c[i-1];
		for(int i=n;i;i--)y[c[bl[i].se]--]=i;
		memset(c,0,n+1<<2);
		for(int i=1;i<=n;i++)c[bl[i].fi]++;
		for(int i=1;i<=n;i++)c[i]+=c[i-1];
		for(int i=n;i;i--)x[c[bl[y[i]].fi]--]=y[i];
		for(int i=1,j=0;i<=n;i++)rk[x[i]]=j+=bl[x[i]]!=bl[x[i-1]];
	};
	static int t[N];memcpy(t,s,sizeof t);sort(t+1,t+n+1);
	for(int i=1,j=0;i<=n;i++)rk[t[i]]=j+=t[i]!=t[i-1];
	for(int i=1;i<=n;i++)bl[i]=mp(rk[s[i]],0);
	for(int k=1;k<=n;k<<=1){grk();for(int i=1;i<=n;i++)bl[i]=mp(rk[i],i+k>n?0:rk[i+k]);}
	grk();for(int i=1;i<=n;i++)sa[rk[i]]=i;
	for(int i=1,h=0;i<=n;i++){h&&h--;for(int j=sa[rk[i]-1];i+h<=n&&j+h<=n&&s[i+h]==s[j+h];h++);ht[rk[i]]=h;}
}
inline int qry(int l,int r){
	if(!a[r]){
		printf("? %d %d\n",l,r);fflush(stdout);
		int x;scanf("%d",&x);return x;
	}
	int _n=n;n=r-l+1;
	init();
	int res=n*(n+1)>>1;
	for(int i=2;i<=n;i++)res-=ht[i];
	n=_n;
	return res;
}
int main(){
	scanf("%d",&n);
	for(int i=1,j=0;i<=n;i++){
		int l=0,r=i-1,mid;
		while(l<r)qry(mid=l+r+1>>1,i)-qry(mid,i-1)^i-mid+1?l=mid:r=mid-1;
		a[i]=!l?++j:a[l];
	}
	printf("!");for(int i=1;i<=n;i++)printf(" %d",a[i]);fflush(stdout);
	return 0;
}