#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int K = 5;
constexpr int H = 5;

pair<int, int> how[2][1 << H];
vector<int> leaf[2][1 << (H + 1)];

bool dfs(int r, int u, int hei, vector<vector<int>> pss) {
  if (hei == 0) {
    assert((int)pss.size() <= 1);
    if (pss.size()) leaf[r][u] = pss[0];
    return true;
  }
  for (int i = 0; i < K; ++i) for (int j = i + 1; j < K; ++j) {
    vector<vector<int>> qsss[2];
    for (const auto &ps : pss) qsss[(ps[i] > ps[j])].push_back(ps);
    for (int e = 0; e < 2; ++e) if ((int)qsss[e].size() > 1 << (hei - 1)) goto failed;
    for (int e = 0; e < 2; ++e) if (!dfs(r, u << 1 | e, hei - 1, qsss[e])) goto failed;
    how[r][u] = make_pair(i, j);
    return true;
   failed:{}
  }
  return false;
}

void build() {
  vector<vector<int>> pss;
  {
    vector<int> ps(K);
    for (int i = 0; i < K; ++i) ps[i] = i;
    do {
      bool ok = true;
      for (int i = 0; i < K; ++i) ok = ok && (ps[i] <= i + 2);
      if (ok) pss.push_back(ps);
    } while (next_permutation(ps.begin(), ps.end()));
  }
  // know ps[K-2] vs ps[K-1] in previous step
  vector<vector<int>> qsss[2];
  for (const auto &ps : pss) qsss[(ps[K - 2] > ps[K - 1]) ? 1 : 0].push_back(ps);
// cerr<<"|pss| = "<<pss.size()<<", |qsss[0]| = "<<qsss[0].size()<<", |qsss[1]| = "<<qsss[1].size()<<endl;
  for (int r = 0; r < 2; ++r) {
    assert((int)qsss[r].size() <= 1 << H);
    const bool res = dfs(r, 1, H, qsss[r]);
    assert(res);
  }
/*
for(int r=0;r<2;++r){
 for(int u=1;u<1<<H;u<<=1)pv(how[r]+u,how[r]+(u<<1));
 pv(leaf[r]+(1<<H),leaf[r]+(1<<(H+1)));
}
*/
}


int N;

// 0: secret[i] < secret[j]
// 1: secret[i] > secret[j]
int ask(int i, int j) {
  if (i <= 0) return 0;
  if (j <= 0) return 1;
  assert(1 <= i); assert(i <= N);
  assert(1 <= j); assert(j <= N);
  assert(i != j);
  printf("? %d %d\n", i, j);
  fflush(stdout);
  char str[10];
  scanf("%s", str);
  if (str[0] == '<') return 0;
  if (str[0] == '>') return 1;
  assert(false);
}

int main() {
  build();
  
  scanf("%d", &N);
  
  vector<int> ans(N + 1, 0);
  
  int n = N;
  vector<int> xs{n - 1, n};
  int r = ask(n - 1, n);
  for (; n >= K - 2; n -= (K - 2)) {
    // determine position of n-2,n-1,n
    for (int i = 0; i < K - 2; ++i) {
      xs.push_back(n - K + 1 + i);
    }
    sort(xs.begin(), xs.end());
    int u = 1;
    for (; u < 1 << H; ) {
      const auto &h = how[r][u];
      const int e = ask(xs[h.first], xs[h.second]);
      u = u << 1 | e;
    }
    const auto &ps = leaf[r][u];
// cerr<<n<<" "<<xs<<" "<<r<<": "<<ps<<endl;
    assert(ps.size());
    vector<int> xxs;
    vector<int> qs;
    for (int i = 0; i < K; ++i) {
      if (ps[i] >= 2) {
        ans[xs[i]] = n - K + 1 + ps[i];
      } else {
        xxs.push_back(xs[i]);
        qs.push_back(ps[i]);
      }
    }
    xs = xxs;
    r = (qs[0] > qs[1]) ? 1 : 0;
  }
  
  for (int i = 0; i < 2; ++i) if (xs[i] >= 1) {
    ans[xs[i]] = n - 1 + (i ^ r);
  }
  
  printf("!");
  for (int x = 1; x <= N; ++x) {
    printf(" %d", ans[x]);
  }
  puts("");
  fflush(stdout);
  return 0;
}