#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int dp[510][510];
void mainmain(){
	int n;
	cin>>n;
	rep(i,510){
		rep(j,510){
			dp[i][j]=-1;
		}
	}
	rep(i,n){
		dp[i][i]=0;
	}
	while(1){
		vint used(n,0);
		vint tmp(2*n,0);
		int cnt=0;
		rep(i,n){
			if(used[i]) continue;
			rep(j,n){
				if(used[j]) continue;
				if(dp[i][j]==-1){
					tmp[cnt++]=i+1;
					tmp[cnt++]=j+1;
					used[i]=used[j]=1;
				}
			}
		}
		cout<<"?";
		rep(i,tmp.size()){
			cout<<" "<<tmp[i];
		}cout<<endl;
		rep(i,n){
			char t;
			cin>>t;
			int x=tmp[i*2]-1;
			int y=tmp[i*2+1]-1;
			if(x<0||y<0) continue;
			if(t=='>'){
				cout<<">"<<endl;
				dp[x][y]=1;
				dp[y][x]=2;
			}
			if(t=='<'){
				cout<<"<"<<endl;
				dp[x][y]=2;
				dp[y][x]=1;
			}
		}
		rep(i,n){
			rep(j,n){
				rep(k,n){
					if(dp[j][i]==1&&dp[i][k]==1){
						dp[j][k]=1;
						dp[k][j]=2;
					}
				}
			}
		}
		bool f=true;
		rep(i,n){
			rep(j,n){
				cout<<dp[i][j]<<" ";
			}
			cout<<endl;
		}
		cout<<endl;
		rep(i,n){
			rep(j,n){
				if(dp[i][j]==-1){
					f=false;
				}
			}
		}
		if(f) break;
	}
	vint used(n);
	vint ans;
	rep(i,n){
		int t=0;
		rep(j,n){
			bool f=true;
			rep(k,n){
				if(used[k]) continue;
				if(dp[j][k]==1) f=false;
			}
			if(f) t=j;
		}
		used[t]=1;
		ans.PB(t);
	}
	cout<<"!";
	rep(i,n){
		cout<<" "<<ans[i]+1;
	}
	cout<<endl;
}


signed main() {
	ios_base::sync_with_stdio(false);
    cin.tie(0);
  	cout<<fixed<<setprecision(20);
    mainmain();
}