#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=1e4+1,M=100+1,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-6;const ll INF=1e18+7;mt19937 rnd(263082);
int n;
map<pii,int> f;
int ask(int x,int y){
	auto it=f.find(make_pair(x,y));if(it!=f.end()) return it->se;
	char c;cout<<"? "<<x<<' '<<y<<endl;
	cin>>c;
	f[make_pair(x,y)]=(c=='<');
	f[make_pair(y,x)]=(c!='<');
	return c=='<';
}
int A[N],B[N],vis[N];
void Solve(){
	cin>>n;
	if(n==1){cout<<"! 1"<<endl;return;}
	iota(B+1,B+n+1,1);
	for(int i=n;i>2;i--) {
		if(vis[i-1]&&vis[i-2]) continue;
		if(vis[i-1]){
			if(!ask(B[i-2],B[i])) swap(B[i-2],B[i]),vis[i-2]=1;
			continue;
		}
		if(vis[i-2]) {
			if(!ask(B[i-1],B[i])) swap(B[i-1],B[i]);
			vis[i-1]=1;
			continue;
		}
		int o1=ask(B[i-2],B[i-1]),o2=ask(B[i-1],B[i]);
		if(o1&&o2) continue;
		if(!o1&&!o2) {swap(B[i-2],B[i]);vis[i-1]=1;continue;}
		int o3=ask(B[i-2],B[i]);
		if(o1&&!o2){
			if(o3){
				swap(B[i-1],B[i]);vis[i-2]=vis[i-1]=1;
			}else{
				swap(B[i-1],B[i]);vis[i-1]=1;
			}
		}else{
			if(o3) continue;
			else swap(B[i-2],B[i]),vis[i-1]=1;
		}
	}
	if(!ask(B[1],B[2])) swap(B[1],B[2]);
	for(int i=1;i<=n;i++) A[B[i]]=i;
	cout<<"! ";for(int i=1;i<=n;i++) cout<<A[i]<<' ';cout<<endl;
}
int main(){
	// freopen("1.in","r",stdin);
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}