#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////


void solve(){
	int N;
	cin >> N;
	vector< vector<int> > v(N,vector<int>(N) );
	int h = N-1;
	vector<bool> use(N,false);
	vector<int> rank(N,0);
	int cnt = 0;
	for(int i=1;i<=h;++i){
		for(int T=0;T<=i && T+i<N;++T){
			use = vector<bool>(N,false);
			cnt = 0;
			cout << "?";
			for(int j=T;j+i<N;++j){
				if( use[j] ) continue;
				if( (j+i) < N ){
					cout << " " << j+1 << " " << (j+i)+1;
					use[j] = true;
					use[(j+i)] = true;
				}else{
					cout << " " << j+1 << " 0";
					use[j] = true;
				}
				++cnt;
			}
			for(int k=cnt;k<N;++k){
				cout << " 0 0";

			}
			cout << endl;
			use = vector<bool>(N,false);
			string str;
			for(int j=T;j+i<N;++j){
				if( use[j] ) continue;
				cin >> str;
				if( (j+i) < N ){
					if( str == "<" ){
						if( v[j][(j+i)] == v[(j+i)][j] ){
							v[j][(j+i)] = true;
							v[(j+i)][j] = false;
							++rank[(j+i)];
						}
					}else if( str == ">" ){
						if( v[j][(j+i)] == v[(j+i)][j] ){
							v[j][(j+i)] = false;
							v[(j+i)][j] = true;
							++rank[j];
						}
					}
					use[j] = true;
					use[(j+i)] = true;
				}else{
					use[j] = true;
				}
			}
			for(int k=cnt;k<N;++k){
				cin >> str;
			}
		}
	}
	vector<int> ret(N,0);
	for(int i=0;i<N;++i){
		ret[ rank[i] ] = i+1;
	}
	cout << "!";
	for(int i=0;i<N;++i){
		cout << " " << ret[i];
	}
	cout << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}