#include <bits/stdc++.h>
#define rep(i, a) rep2 (i, 0, a)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) repr2 (i, 0, a)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
#define rng(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;

vector<int> query(vector<int> a, bool odd) {
	int n = a.size();
	cout << "?";
	rep (i, n - 1) {
		if (i % 2 == odd) {
			cout << " " << a[i] << " " << a[i + 1];
		} else {
			cout << " 0 0";
		}
	}
	cout << " 0 0" << endl;
	vector<int> res;
	rep (i, n) {
		string s;
		cin >> s;
		if (s[0] == '=') res.push_back(0);
		else if (s[0] == '<') res.push_back(-1);
		else res.push_back(1);
	}
	return res;
}

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep (i, n) a[i] = i + 1;
	rep (i, n) {
		auto even = query(a, false);
		for (int i = 0; i + 1 < n; i += 2) {
			if (even[i] > 0) swap(a[i], a[i + 1]);
		}
		auto odd = query(a, true);
		for (int i = 1; i + 1 < n; i += 2) {
			if (odd[i] > 0) swap(a[i], a[i + 1]);
		}
	}
	cout << "!";
	rep (i, n) cout << " " << a[i];
	cout << endl;
    return 0;
}