#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;

int ord[54][5], used[5], now[5], len;

void dfs(int u) {
	if (u == -1) {
		memcpy(ord[len], now, sizeof(ord[len]));
		++len;
		return;
	}
	int l = max(0, u - 2), r = 4;
	for (int i = l; i <= r; i++) {
		if (!used[i]) {
			used[i] = 1;
			now[i] = u;
			dfs(u - 1);
			used[i] = 0;
		}
	}
}

map <ull, pair <int, int> > f[10];
map <ull, int> qwq[10];
int n;

pair <ull, ull> gao(ull x, int u, int v) {
	ull v1 = 0, v2 = 0;
	for (int i = 0; i < 54; i++) {
		if ((x >> i) & 1) {
			if (ord[i][u] < ord[i][v]) v1 |= (1ull << i);
			else v2 |= (1ull << i);
		}
	}
	return make_pair(v1, v2);
}

int solve(ull x, int dep) {
	// if ((x & -x) == x) return dep >= -1;
	if (x == 0) return dep >= -1;
	if (__builtin_popcountll(x) == 1) return dep >= -1;
	if (dep < 0) return 0;
	if (qwq[dep].count(x)) return qwq[dep][x];
	for (int u = (x == (1ull << 54) - 1 ? 3 : 0); u < 4; u++) {
		for (int v = u + 1; v <= 4; v++) {
			pair <ull, ull> t = gao(x, u, v);
			int cc = max(__builtin_popcountll(t.first), __builtin_popcountll(t.second));
			if (__lg(cc) > dep) continue;
			int v1 = solve(t.first, dep - 1);
			if (!v1) continue;
			int v2 = solve(t.second, dep - 1);
			if (!v2) continue;
			f[dep][x] = make_pair(u, v);
			qwq[dep][x] = 1;
			return 1;
		}
	}
	qwq[dep][x] = 0;
	return 0;
}

mt19937 rng(0);
int ans[30005], a[30005];
int last;

int query(int u, int v) {
	cout << "? " << u << " " << v << endl;
	char c;
	cin >> c;
	return c == '>';
}

int main() {
	dfs(4);
	solve((1ull << 54) - 1, 5);
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	if (n == 1) {
		cout << "! 1" << endl;
		return 0;
	}
	/*
	for (int i = 1; i <= n; i++) {
		a[i] = i;
	}
	for (int i = 1; i <= n; i++) {
		int l = i, r = min(n, i + 2);
		swap(a[i], a[rng() % (r - l + 1) + l]);
	}
	*/
	last = query(n - 1, n);
	int pos[5] = {0, 0, 0, n - 1, n};
	int i;
	for (i = n; i >= 5; i -= 3) {
		pos[0] = i - 4; pos[1] = i - 3; pos[2] = i - 2;
		ull now = (1ull << 54) - 1;
		int flag = 0, dep = 5;
		while ((now & -now) != now) {
			assert(f[dep].count(now));
			// fprintf(stderr, "now = %llu, popc = %d\n", now, __builtin_popcountll(now));
			pair <int, int> t = f[dep][now]; --dep;
			int res;
			if (!flag) {
				flag = 1;
				res = last;
			} else {
				res = query(pos[t.first], pos[t.second]);
			}
			pair <ull, ull> v = gao(now, t.first, t.second);
			if (res) now = v.second;
			else now = v.first;
		}
		int id = 0;
		while ((1ull << id) != now) ++id;
		// fprintf(stderr, "id = %d\n", id);
		// for (int j = 0; j < 5; j++) fprintf(stderr, "ord[%d] = %d, pos[%d] = %d\n", j, ord[id][j], j, pos[j]);
		int pos0 = -1, pos1 = -1;
		for (int j = 0; j < 5; j++) {
			if (ord[id][j] >= 2) {
				ans[pos[j]] = i - 4 + ord[id][j];
			} else {
				if (ord[id][j] == 0) pos0 = pos[j];
				else pos1 = pos[j];
			}
		}
		assert(pos0 != -1 && pos1 != -1);
		if (pos0 < pos1) {
			last = 0;
		} else {
			last = 1;
			swap(pos0, pos1);
		}
		pos[3] = pos0; pos[4] = pos1;
	}
	// fprintf(stderr, "i = %d\n", i);
	for (; i >= 3; i--) {
		pos[2] = i - 2;
		int mx = last ? pos[3] : pos[4];
		if (query(pos[2], mx)) {
			mx = pos[2];
		} else {
			if (mx == pos[3]) {
				pos[3] = pos[2];
			} else {
				pos[4] = pos[3];
				pos[3] = pos[2];
			}
			last = query(pos[3], pos[4]);
		}
		ans[mx] = i;
	}
	if (last) ans[pos[3]] = 2, ans[pos[4]] = 1;
	else ans[pos[3]] = 1, ans[pos[4]] = 2;
	cout << "!";
	for (int i = 1; i <= n; i++) cout << " " << ans[i];
	cout << endl;
	return 0;
}