#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int partner(int n, int l, int p) {
	if(p == 1) {
		return n ^ (1 << (l-1));
	}else {
		int scale = 1 << (l - p), box = 1 << p;
		int sn = n / scale - (n / scale / box) * box;
		if(sn == 0 || sn == box - 1)
			return n;
		else if(sn % 2 == 0)
			return n - scale;
		else
			return n + scale;
	}
}

int main() {
	int N;
	while(cin >> N) {
		vi perm(N);
		iota(all(perm), 1);
		int d = 0;
		while((1 << d) < N) ++ d;
		rer(l, 1, d) rer(p, 1, l) {
//			rep(i, N) cerr << perm[i] << " "; cerr << endl;
			vector<bool> vis(N, false);
			vector<pii> wires;
			rep(i, N) if(!vis[i]) {
				int j = partner(i, l, p);
				if(j != i && j < N) {
					assert(!vis[j]);
					wires.push_back(mp(i, j));
					vis[i] = vis[j] = true;
				}
			}
			each(i, wires) if(i->first > i->second)
				swap(i->first, i->second);
			printf("?");
			each(i, wires)
				printf(" %d %d", perm[i->first], perm[i->second]);
			rep(i, N - (int)wires.size())
				printf(" 0 0");
			puts("");
			fflush(stdout);
			char s[2];
			each(i, wires) {
				scanf("%s", s);
				assert(*s != '=');
				if(*s == '>')
					swap(perm[i->first], perm[i->second]);
			}
			rep(i, N - (int)wires.size())
				scanf("%s", s);
		}
		printf("!");
		rep(i, N)
			printf(" %d", perm[i]);
		puts("");
		fflush(stdout);
	}
	return 0;
}