#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
long long int fast_exp(long long int base, long long int exp1) {
  long long int res = 1;
  while (exp1 > 0) {
    if (exp1 & 1) res = (res * base) % 1000000007;
    base = (base * base) % 1000000007;
    exp1 /= 2;
  }
  return res % 1000000007;
}
long long int pr[1000001] = {0};
void isprime() {
  pr[0] = 1;
  pr[1] = 1;
  for (long long int a = 2; a * a <= 1000001; a++) {
    if (!pr[a]) {
      for (long long int b = a * a; b < 1000001; b += a) {
        pr[b] = 1;
      }
    }
  }
}
long long int comp = 1, tim = 0;
struct vertex {
  vector<long long int> adj;
  long long int vis = 0;
  long long int parent = -1;
  long long int dist = 0;
  long long int component = 0;
  long long int in = 0;
  long long int out = 0;
  long long int low = 0;
  long long int child = 0;
  long long int indeg = 0;
  long long int outdeg = 0;
  bool AP = false;
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 0;
  cin >> t;
  for (long long int test = 0; test < t; test++) {
    long long int n;
    cin >> n;
    string s;
    cin >> s;
    long long int ans = 0;
    for (long long int a = 0; a < n - 1; a++)
      if (s[a] == '<' and s[a + 1] == '>') ans++;
    if (ans == 0) {
      cout << ans << endl;
      continue;
    }
    reverse(s.begin(), s.end());
    ans = 0;
    long long int po = 0;
    while (po < n - 1 and s[po] == '>') ans++, po++;
    cout << ans << endl;
  }
  return 0;
}
