#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;


#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

pair<int, int> cnt[500];
int query[600][500][2];
void sp(int d, int left, int right){
	int num = (right - left);
	int half = num / 2;
	if (half == 0)return;
	for (int i = 0; i < num - half; i++){
		for (int j = left; j < left + half; j++)
			query[d + i][j][0] = j+1;
		for (int j = 0; j < num - half; j++){
			query[d + i][(j + i) % (num - half) + left][1] = left +half+ j+1;
		}
	}
	sp(d + num - half, left, left + half);
	sp(d + num - half, left + half, right);
}
int main(void){
	int N;
	cin >> N;
	for (int i = 0; i <N; i++){
		cnt[i].first = 0; 
		cnt[i].second = i + 1;
		for (int j = 0; j < N; j++)
			query[i][j][0] = query[i][j][1] = 0;
	}
	sp(0,0, N);
	for (int i = 0; i < 600; i++){
		cout << "?";
		for (int j = 0; j < N; j++){
			cout <<" "<< query[i][j][0] << " " << query[i][j][1];
		}
		cout << endl << flush;
		for (int j = 0; j < N; j++){
			string s;
			cin >> s;
			if (s == ">")cnt[query[i][j][0]].first++;
			else if (s == "<")cnt[query[i][j][1]].first++;
		}
	}
	sort(cnt, cnt + N);
	cout << "!";
	for (int i = 0; i < N; i++){
		cout << " " << cnt[i].second;
	}
	cout << endl << flush << endl;
	return(0);
}