#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int more[501][501];
int id[501];
char res[501];
pair<int,int> H[501];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	if(N==1) {
		_P("! 1\n");
		return;
	}
	FOR(i,N) H[i].second=i+1;
	
	if(N%2==0) {
		FOR(i,N-1) {
			FOR(j,N-1) id[j]=(i+j)%(N-1);
			id[N-1]=N-1;
			_P("!");
			FOR(i,N/2) _P(" %d %d",id[i]+1,id[i+N/2]+1);
			FOR(i,N/2) _P(" 0 0");
			_P("\n");
			fflush(stdout);
			FOR(i,N/2) scanf("%c",&res[i]);
			FOR(i,N/2) {
				if(res[i]=='>') H[id[i+N/2]].first++;
				if(res[i]=='<') H[id[i]].first++;
			}
		}
		sort(H,H+N);
		_P("!");
		FOR(i,N) _P(" %d",H[i].second);
		_P("\n");
		
	}
	else {
		assert(0);
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}