#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
using namespace std;

long long gcd(long long x,long long y){
	return y==0?x:gcd(y,x%y);
}

int main(){

	int n;
	cin>>n;
	
	set<int> s;
	vector<int> ans;
	for(int i=0;i<n;i++){
		s.insert(i+1);
		//cin>>a[i];
	}
	
	while(!s.empty()){

/*		
		cout<<"s=[";
		for(auto it=s.begin();it!=s.end();it++) cout<<(*it)<<" ";
		cout<<"]"<<endl;
*/		
		vector<int> heavy(s.begin(),s.end());

		while(true){
			while(heavy.size()!=2*n) heavy.push_back(0);
			cout<<"?";
			for(int i=0;i<heavy.size();i++) cout<<" "<<heavy[i];
			cout<<endl;
			
			vector<string> result(n);
			int cnt=0;
			for(int i=0;i<n;i++){
				cin>>result[i];
				if(result[i]!="=") cnt++;
			}
			if(cnt==1){
			
				if(result[0]==">"){
					ans.push_back(heavy[0]);
					if(heavy[1]!=0) ans.push_back(heavy[1]);
				}else{
					ans.push_back(heavy[1]);
					if(heavy[0]!=0) ans.push_back(heavy[0]);			
				}

				s.erase(heavy[0]);
				s.erase(heavy[1]);		
				break;	
			}

			vector<int> next_h;
			for(int i=0;i<n;i++){
				if(result[i]==">") next_h.push_back(heavy[2*i]);
				else if(result[i]=="<") next_h.push_back(heavy[2*i+1]); 
			}
			swap(heavy,next_h);
		}
		
	}

	cout<<"!";
	for(int i=n-1;i>=0;i--) cout<<" "<<ans[i];
	cout<<endl;

}