#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int,int> pii;
const int MAXN = 2011;
int a[MAXN];
pii b[MAXN],tp[MAXN];
map<pii,int>mp;
int get(int l,int r)
{
	if(l>=r)return 0;
	if(mp.count(pii(l,r)))return mp[pii(l,r)];
	cout<<"? "<<l<<" "<<r<<endl;
	int x;
	cin>>x;
	return mp[pii(l,r)]=x;
}
void printans(int n)
{
	cout<<"!";
	for(int i=1;i<=n;++i)cout<<" "<<a[i];
	cout<<endl;
}
bool less(int i,int j)
{
	int all=get(i,j);
	int t=get(i,j-1)^get(i+1,j)^get(i+1,j-1);
	return all==t;
}
void solve(int l,int r)
{
	if(l==r){a[l]=1,b[l]=pii(1,l);return;}
	int mid=(l+r)>>1;
	solve(l,mid),solve(mid+1,r);
	int i=l,j=mid+1,k=l;
	while(i<=mid&&j<=r)
	{
		if(::less(b[i].second,b[j].second))a[b[i].second]+=j-(mid+1), tp[k++]=b[i++];
		else a[b[j].second]+=i-l,tp[k++]=b[j++];
	}
	while(i<=mid)a[b[i].second]+=j-(mid+1),tp[k++]=b[i++];
	while(j<=r)a[b[j].second]+=i-l,tp[k++]=b[j++];
	for(int i=l;i<=r;++i)b[i]=tp[i];
}
int main()
{
	int n;
	cin>>n;
	solve(1,n);
	printans(n);
	return 0;
}
//4 
//4 1 2 3