#include using namespace std; using VS = vector; using LL = long long; using VI = vector; using VVI = vector; using PII = pair; using PLL = pair; using VL = vector; using VVL = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--) #define debug(x) cerr << #x << ": " << x << endl const int INF = 1e9; const LL LINF = 1e16; const LL MOD = 1000000007; const double PI = acos(-1.0); int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- 2018/09/26 Problem: yukicoder 282 / Link: http://yukicoder.me/problems/no/282 ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ int main() { cin.tie(0); ios_base::sync_with_stdio(false); LL N; cin >> N; auto ask = [&N](VI &a,int firststate) { cout << "?"; int cnt = 0; for (int i = firststate & 1; i + 1 < N; i += 2) { cnt++; cout << " " << a[i] << " " << a[i + 1]; } FOR(i, cnt, N) { cout << " 0 0"; } cout << endl; vector res(N); char ex; cin >> ex; FOR(i, 0, N) { cin >> res[i]; } return res; }; VI a(N); iota(ALL(a), 1); FOR(st, 0, 2 * N) { vectorres = ask(a, st); FOR(i, 0, SZ(res)) { if (res[i] == '>') { swap(a[st & 1 + 2*i], a[st & 1 + 2*i + 1]); } } } cout << "!"; FOR(i, 0, N) { cout <<" "<< a[i]; } cout << endl; return 0; }