#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int N;
  cin >> N;

  vector<int> v;
  rep(i,N){
    v.push_back(i+1);
  }

  int ok = 0;
  bool flg = true;
  int turn = 1;
  while(ok != 2){
    flg = false;
    turn = 1 - turn;

    cout << "?";
    for(int i=0; i<v.size(); i+=2){
      if(i+turn+1<v.size()){
        cout << " " << v[i+turn] << " " << v[i+turn+1];
      }else{
        cout << " 0 0";
      }
    }
    cout << endl;
    
    string tmp;
    for(int i=0; i<v.size(); i+=2){
      cin >> tmp;
      if(i+turn+1<v.size()){
        if(tmp == ">"){
          swap(v[i+turn],v[i+turn+1]);
          flg = true;
        }
      }
    }
    if(!flg) ok++;
  }

  cout << "!";
  rep(i,N){
    cout << " " << v[i];
  }
  cout << endl;
 
  return 0;
}