#include<bits/stdc++.h>

#ifdef DEBUG
#include<random>
#include<time.h>
#include<assert.h>
#endif

using namespace std;

const int mmp[] = {
134217727,3,2400255,2400255,13,2396745,2396745,2,585,585,7,513,513,1,1,1,-1,1234,512,-1,10234,72,8,8,8,-1,2134,64,-1,3124,2396160,1,36864,36864,8,4096,4096,-1,12034,32768,-1,13024,2359296,7,262144,262144,-1,20134,2097152,-1,21034,3510,8,3078,3078,1,6,6,14,2,2,-1,1324,4,-1,1423,3072,14,1024,1024,-1,10324,2048,-1,10423,432,14,144,144,7,16,16,-1,2314,128,-1,3214,288,9,32,32,-1,2413,256,-1,3412,131817472,1,117661696,117661696,7,67264512,67264512,9,24576,24576,14,8192,8192,-1,12304,16384,-1,12403,67239936,4,131072,131072,-1,13402,67108864,-1,23401,50397184,2,65536,65536,-1,13204,50331648,13,16777216,16777216,-1,23014,33554432,-1,23104,14155776,8,1572864,1572864,14,524288,524288,-1,20314,1048576,-1,20413,12582912,14,4194304,4194304,-1,21304,8388608,-1,21403,-1
};
map<int,pair<int,int> > mp;

int n, g[30033], o[30033];
void init(){
#ifdef DEBUG
	mt19937 rng(time(0));
	for(int i=1; i<=n; i++)g[i] = i;
	for(int i=1; i<=n; i++){
		int t = rng()%3+i;
		if(t > n)t = n;
		if(i!=t)swap(g[i], g[t]);
	}
#endif
}

bool q(int x, int y){
	if(x <= 0 && y <= 0)return x < y;
	if(x <= 0)return true;
	if(y <= 0)return false;
#ifdef DEBUG
	return g[x] < g[y];
#else
	printf("? %d %d\n",x,y);
	fflush(stdout);
	char ss[9];
	scanf("%s",ss);
	return *ss == '<';
#endif
}

void tri(int name,int A,int B,int C,int&D,int&E){
	int b[5],c[5];
	b[0] = A;b[1] = B;b[2] = C;b[3] = D;b[4] = E;
	int msk = mmp[0];
	while(1){
		int way = mp[msk].first;
		int H = mp[msk].second;
		if(way == -1)break;
		int id1 = way / 5, id2 = way % 5;
		if(q(b[id1], b[id2]))
			msk = H;
		else
			msk -= H;
	}
	int H = mp[msk].second;
	for(int i=4; i>=0; i--)c[i] = H%10,H/=10;
	for(int i=0; i<5; i++)switch(c[i]){
	case 0: D = b[i]; break;
	case 1: E = b[i]; break;
	case 2: if(b[i]>0)o[b[i]] = name; break;
	case 3: if(b[i]>0)o[b[i]] = name+1; break;
	case 4: if(b[i]>0)o[b[i]] = name+2; break;
	}
}


int main(){
	for(int i=0; mmp[i]!=-1; i+=3)mp[mmp[i]] = make_pair(mmp[i+1],mmp[i+2]);
	scanf("%d", &n);
#ifdef DEBUG
	init();
#endif
	if(n == 1){
		printf("! 1\n");fflush(stdout);
		return 0;
	}
	int A = n-1, B = n;
	if(!q(n-1, n))swap(A, B);
	for(int i = n-2; i >= -1; i -= 3)
		tri(i,i-2, i-1, i, A, B);
#ifdef DEBUG
	for(int i=1; i<=n; i++)assert(g[i] == o[i]);
#else
	printf("!");for(int i=1; i<=n; i++)printf(" %d",o[i]);puts("");fflush(stdout);
#endif
	return 0;
}