#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

int main() {
  int n;
  cin >> n;
  char a[n+1][n+1];
  for (int i = 1; i < n; i++) {
    bool vis[n+1];
    memset(vis, false, sizeof(vis));
    int cnt = 0;
    std::cout << "? ";
    for (int j = 1; j <= n; j++) {
      if (vis[j]) {
	continue;
      }
      if (j+i > n) {
	continue;
      }
      cnt++;
      cout << j << " " << j+i << " ";
      vis[j] = vis[j+i] = true;
    }
    for (int j = 0; j < n-cnt; j++) {
      std::cout << "0 0 ";
    }
    std::cout << std::endl;

    cnt = 0;
    memset(vis, false, sizeof(vis));
    for (int j = 1; j <= n; j++) {
      if (vis[j]) {
	continue;
      }
      if (j+i > n) {
	continue;
      }
      cnt++;

      cin >> a[j][j+i];
      vis[j] = vis[j+i] = true;
    }
    for (int j = 0; j < n-cnt; j++) {
      char c; cin >> c;
    }

    memset(vis, false, sizeof(vis));
    cnt = 0;
    std::cout << "? ";
    for (int j = 1+i; j <= n; j++) {
      if (vis[j]) {
	continue;
      }
      if (j+i > n) {
	continue;
      }
      cnt++;
      std::cout << j << " " << j+i << " ";
      vis[j] = vis[j+i] = true;
    }
    for (int j = 0; j < n-cnt; j++) {
      std::cout << "0 0 ";
    }
    std::cout << std::endl;

    cnt = 0;
    memset(vis, false, sizeof(vis));
    for (int j = 1+i; j <= n; j++) {
      if (vis[j]) {
	continue;
      }
      if (j+i > n) {
	continue;
      }
      cnt++;

      cin >> a[j][j+i];
      vis[j] = vis[j+i] = true;
    }
    for (int j = 0; j < n-cnt; j++) {
      char c; cin >> c;
    }
  }

  int cnt = 0;
  int ans[n];
  bool vis[n+1];
  memset(vis, false, sizeof(vis));

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (vis[j]) continue;
      bool ok = true;
      for (int k = 1; k <= n; k++) {
	if (j == k || vis[k]) continue;
	if (j > k) {
	  if (a[k][j] == '<') {
	    ok = false;
	    break;
	  }
	}else {
	  if (a[j][k] == '>') {
	    ok = false;
	    break;
	  }
	}	
      }
      if (ok) {
	ans[cnt] = j;
	vis[j] = true;
	cnt++;
      }

    }
  }
  for (int i = 1; i <= n; i++) {
    if (vis[i]) continue;
    ans[cnt] = i;
    break;
  }

  std::cout << "! ";
  for (int i = 0; i < n; i++) {
    std::cout << ans[i] << " ";
  }
  std::cout << std::endl;
}