#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2011;
int a[MAXN];
int get(int l,int r)
{
	if(l>=r)return 0;
	cout<<"? "<<l<<" "<<r<<endl;
	int x;
	cin>>x;
	return 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;return;}
	int mid=(l+r)>>1;
	solve(l,mid),solve(mid+1,r);
	int i=l,j=mid+1;
	while(i<=mid&&j<=r)
	{
		if(::less(i,j))a[i]+=j-(mid+1), ++i;
		else a[j]+=i-l,++j;
	}
	while(i<=mid)a[i]+=j-(mid+1),++i;
	while(j<=r)a[j]+=i-l,++j;
}
int main()
{
	int n;
	cin>>n;
	solve(1,n);
	printans(n);
	return 0;
}