#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B, typename C>
struct triple {
  A X;
  B Y;
  C Z;
  triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}
};
template <typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
  return triple<A, B, C>(a, b, c);
}
template <typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
  if (a.X != b.X) return a.X < b.X;
  if (a.Y != b.Y) return a.Y < b.Y;
  return a.Z < b.Z;
}
template <typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
  ofs << "( " << p.first << " , " << p.second << " )";
  return ofs;
}
template <typename T>
void print(T a) {
  for (auto i : a) cout << i << ' ';
  cout << '\n';
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
signed main() {
  srand(time(NULL));
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  auto solve = []() {
    long long n;
    cin >> n;
    string s;
    cin >> s;
    vector<vector<long long> > g1(n), g2(n);
    for (long long i = 0; i + 1 < n; i++)
      if (s[i] == '>') {
        g1[i + 1].push_back(i);
        g2[i].push_back(i + 1);
      } else {
        g1[i].push_back(i + 1);
        g2[i + 1].push_back(i);
      }
    set<long long> good;
    for (long long i = 0; i < (n); i++)
      if (!g1[i].size()) good.insert(i);
    vector<long long> d1(n), d2(n);
    for (long long i = 0; i < (n); i++)
      d1[i] = g1[i].size(), d2[i] = g2[i].size();
    long long now = n;
    vector<long long> ans1(n), ans2(n);
    while (good.size()) {
      long long v = *good.begin();
      good.erase(good.begin());
      ans2[v] = now--;
      for (auto x : g2[v]) {
        d1[x]--;
        if (!d1[x]) good.insert(x);
      }
    }
    now = 1;
    for (long long i = 0; i < (n); i++)
      if (!g2[i].size()) good.insert(i);
    while (good.size()) {
      long long v = *good.begin();
      good.erase(good.begin());
      ans1[v] = now++;
      for (auto x : g1[v]) {
        d2[x]--;
        if (!d2[x]) good.insert(x);
      }
    }
    print(ans2);
    print(ans1);
  };
  long long q;
  cin >> q;
  for (long long _ = 0; _ < (q); _++) solve();
}
