#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
int N;
const int INFTY = (int)1e9+1;
vector<int> A(510);
vector<int> L(500);
vector<int> R(500);

bool check(int A,int B){
	// <=
	if( A != INFTY && B == INFTY ){
		return true;
	}else if( A == INFTY && B != INFTY ){
		return false;
	}else if( A== INFTY && B == INFTY ){
		return true;
	}
	cout << "? " << A << " " << B;
	for(int i=1;i<N;++i){
		cout << " 0 0";
	}
	cout << endl;
	string str,sub;
	cin >> str;
	for(int i=1;i<N;++i){
		cin >> sub;
	}
	if( str == "<" || str == "=" ){
		return true;
	}else{
		return false;
	}
	return false;
}
void merge(int left,int mid,int right){
	int n1 = mid - left;
	int n2 = right - mid;
	
	for(int i=0;i<n1; ++i){L[i] = A[left+i];}
	for(int i=0;i<n2; ++i){R[i] = A[mid+i];}
	
    L[n1] = INFTY;
    R[n2] = INFTY;
    int i,j;
    i = 0;
    j = 0;
    for(int k=left; k<right;++k){
        //if( L[i] <= R[j] ){
		if( check ( L[i] , R[j] ) ){//<=
            A[k] = L[i];
            ++i;
        }else{
            A[k] = R[j];
            ++j;
        }
    }
    return ;
}

void mergeSort(int left,int right){
    if( left+1 < right ){
        int mid = (left+right)/2;
        mergeSort(left, mid);
        mergeSort(mid, right);
        merge(left, mid, right);
    }
    return;
}
void solve(){
	cin >> N;
	A.resize(N);
	rep(i,N){
		A[i] = i+1;
	}
	mergeSort(0,N);
	
	cout << "!";
	for(int i=0;i<N;++i){
		cout << " " << A[i];
	}
	cout << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}