#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e3+5,M=N*40+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,A[N],f[N][N],B[N];
int calc(int x,int y){
	if(x>y) return 0;
	if(~f[x][y]) return f[x][y];
	cout<<"? "<<x<<' '<<y<<endl;
	cin>>f[x][y];return f[x][y];
}
int qry(int x,int y){return (calc(x,y)-calc(x+1,y)-calc(x,y-1)+calc(x+1,y-1)+2)&1;}
void insert(int x){
	int l=0,r=x,mid;
	while(l+1<r){
		mid=l+r>>1;
		if(qry(B[mid],x)) r=mid;else l=mid;
	}
	A[x]=l+1;
	for(int i=1;i<x;i++) if(A[i]>l) A[i]++;
	for(int i=1;i<=x;i++) B[A[i]]=i;
	f[x][x]=0;for(int i=x-1;i;i--) f[i][x]=(f[i+1][x]+f[i][x-1]-f[i+1][x-1]+(A[i]>A[x])+2)&1;
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) for(j=i;j<=n;j++) f[i][j]=-1;
	for(i=1;i<=n;i++) insert(i);
	cout<<"! ";
	for(i=1;i<=n;i++) cout<<A[i]<<' ';cout<<endl;
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}