#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define max2(a,b) a=max(a,b)

bool A[500][500];

int main()
{
	int n; cin >> n;
	vector<vector<int>>from(n);

	bool flag = true;
	while (flag) {
		cout << "?";
		vector<bool>B(n);
		vector<pair<int, int>>P;
		for (int i = 0; i < n; i++) {
			if (B[i])continue;
			for (int j = i + 1; j < n; j++) {
				if (B[j] || A[i][j])continue;
				else {
					cout << " " << i + 1 << " " << j + 1;
					B[i] = B[j] = true;
					A[i][j] = true;
					P.push_back(make_pair(i,j));
					break;
				}
			}
		}
		if (P.size() == 0)flag = false;
		for (int i = P.size(); i < n; i++)cout << " " << 0 << " " << 0;
		cout << endl;

		for (int i = 0; i < P.size(); i++) {
			char c; cin >> c;
			if (c == '<') {
				from[P[i].second].push_back(P[i].first);
			}
			else if (c == '>') {
				from[P[i].first].push_back(P[i].second);
			}
		}
		for (int i = P.size(); i < n; i++) {
			char c; cin >> c;
		}
	}

	vector<int>ans(n);
	for (int i = 0; i < n; i++) {
		ans[from[i].size()] = i + 1;
	}

	cout << "!";
	for (int i = 0; i < n; i++) {
		cout << " " << ans[i];
	}
	cout << endl;

    return 0;
}