#include<cstdio>
#include<algorithm>
#include<unordered_map>
//#define getchar getchar_unlocked
//#define putchar putchar_unlocked
template<typename T>void read(T &x){
	x=0;bool f=0;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);
	if(f)x=-x;
}
void write(char x){putchar(x);}
template<typename T>void write(T x){
	if(x<0)putchar('-'),x=-x;
	char stk[24];int cnt=0;
	do stk[++cnt]=x%10+48,x/=10;while(x);
	for(;cnt;)putchar(stk[cnt--]);
}
template<typename T,typename ...Args>void read(T &x,Args &...args){read(x);read(args...);}
template<typename T,typename ...Args>void write(T x,Args ...args){write(x);write(args...);}
template<typename T>T min(T x,T y){return x<y?x:y;}
template<typename T>T max(T x,T y){return x>y?x:y;}
int n,last[1004],tot,a[1004],sum[1004];unsigned long long jk;
std::unordered_map<unsigned long long,int>mp;
signed main(){
	read(n);
	for(int i=1;i<=n;++i){
		int l=1,r=i-1,jk=0;
		for(;l<=r;){
			int mid=(l+r)>>1;
			write('?',' ',mid,' ',i,'\n');fflush(stdout);
			int tmp,op=a[mid];read(tmp);
			if(tmp-op==i-mid+1)r=mid-1;
			else jk=mid,l=mid+1;
		}
		jk?last[i]=last[jk]:last[i]=++tot;
		jk=0;
		for(int j=i;j;--i)jk=jk*19491001+last[j],sum[mp[jk]+1]++,sum[j+1]--,mp[jk]=j;
		for(int j=1;j<=i;++j)sum[j]+=sum[j-1];
		for(int j=1;j<=i;++j)a[j]+=sum[j],sum[j]=0;
	}
	write('!',' ');
	for(int i=1;i<=n;++i)write(last[i],' ');
	fflush(stdout);
	return 0;
}