#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=2010;
const ll mod=998244353;
//const ll mod=1e9+7;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define vi vector <int>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
#define pb emplace_back
#define pii pair<int,int>
#define debug(x) std::cout<<x<<endl
//#define endl '\n'
#define mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
template<typename type>
inline void read(type &x)
{
    x=0;bool flag(0);char ch=getchar();
    while(!isdigit(ch)) flag=ch=='-',ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    flag?x=-x:0;
}
template<typename type>
inline void write(type x,bool mode=1)//0为空格，1为换行
{
    x<0?x=-x,putchar('-'):0;static short Stack[50],top(0);
    do Stack[++top]=x%10,x/=10; while(x);
    while(top) putchar(Stack[top--]|48);
    mode?putchar('\n'):putchar(' ');
}
//head~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//begin~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//end~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ll a[N],n,dis[N][N];
bool query(int l,int r){
	if(dis[l][r]!=-1){
		return dis[l][r];
	}
	if(l==r){
		return 0;
	}
	cout<<"? "<<l<<" "<<r<<endl;
	int ans;cin>>ans;
	dis[l][r]=ans;
	return ans;
}
int ans[N],pos[N];
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i==j){
				dis[i][j]=0;
			}else{
				dis[i][j]=-1;
			}
		}
	}
	pos[1]=1;
	for(int i=2;i<=n;i++){
		int l=1,r=i-1;
		while(l<r){
			int mid=(l+r)>>1;
			int x=0;
			for(int j=1;j<mid;j++){
				if(pos[mid]<pos[j]){
					x++;
				}
			}
			if(query(pos[mid],i)!=(query(pos[mid]+1,i)+x)%2){
				r=mid;
			}else{
				l=mid+1;
			}
		}
		if(query(i-1,i)==0&&l==i-1){
			l=i;
		}
		for(int j=i;j>l;j--){
			pos[j]=pos[j-1];
		}
		pos[l]=i;
	}
	cout<<"! ";
	for(int i=1;i<=n;i++){
		ans[pos[i]]=i;
	}
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<" ";
	}
}


int main() 
{
	std::ios::sync_with_stdio(false);
	cin.tie(0); 
	cout.tie(0);
	int _=1;
	while(_--){
		solve();
	}
    return 0;
}