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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, a[512], b[512];

int ll[512], rr[512];
string q[512];
void ask() {
	cout << "?";
	inc(i, n) {
		cout << " " << a[ll[i]];
		cout << " " << a[rr[i]];
	}
	cout << endl;
	
	inc(i, 512) { q[i] = "="; }
	inc(i, n) { cin >> q[i]; }
}

void solve(int v) {
	int w = (1 << v);
	int c = 512 / w;
	
	inc(i, 512) { ll[i] = rr[i] = n + 1; }
	inc(i, c) {
		ll[i] = i * w;
		rr[i] = i * w + w / 2;
	}
	
	inc(k, w) {
		ask();
		inc(i, c) {
			if(q[i] == "=") { continue; }
			b[i * w + k] = a[ (q[i] == ">" ? ll : rr)[i]++ ];
			if(ll[i] == i * w + w / 2) { ll[i] = n + 1; }
			if(rr[i] == i * w + w    ) { rr[i] = n + 1; }
		}
	}
	
	inc(i, 512) { a[i] = b[i]; }
}

void ans() {
	cout << "!";
	dec(i, n) { cout << " " << a[i]; }
	cout << endl;
}

int main() {
	cin >> n;
	
	inc(i, n) { a[i] = i + 1; }
	inc1(i, 9) { solve(i); }
	ans();
	
	return 0;
}