// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
typedef vector<pii>vpii;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n;
int a[2005],pos[2005];

int ans[2005][2005];
int Q(int l,int r){
	if(l>=r)return 0;
	if(ans[l][r]!=-1)return ans[l][r];
	cout<<"? "<<l<<' '<<r<<endl;
	cin>>ans[l][r];return ans[l][r];
}

bool comp(int x,int r){
	// ask if a[r]<X 
	int s=Q(pos[x],r)^Q(pos[x]+1,r);
	For(i,pos[x]+1,r-1) s^=(x>a[i]);
	return s;
}

signed main()
{
	cin>>n;
	memset(ans,-1,sizeof ans);
	a[1]=1;
	For(i,2,n){
		int l=1,r=i-1,res=i;
		For(j,1,i-1)pos[a[j]]=j;
		while(l<=r){
			int mid=l+r>>1;
			if(comp(mid,i)) res=mid,r=mid-1;
			else l=mid+1;
		}
		a[i]=res;
		For(j,1,i-1)if(a[j]>=res)++a[j];
	}
	cout<<"!";
	For(i,1,n)cout<<" "<<a[i];
	cout<<endl;
	return 0;
}
/*
4
2 3 1 4
*/