#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int INF = 0x3f3f3f3f;
void read(int &val) {
  int x = 0;
  int bz = 1;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
    ;
  if (c == '-') {
    bz = -1;
    c = getchar();
  }
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  val = x * bz;
}
int t, n, m, k, q;
int ans, cnt, flag, temp, sum;
int a[maxn];
char str[maxn];
struct node {};
char str1[maxn];
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    scanf("%s", str);
    str1[0] = str[0];
    cnt = 0;
    for (int i = 1; i < n; i++) {
      if (str[i - 1] != str[i]) {
        str1[++cnt] = str[i];
      }
    }
    if (str1[0] == '>' || str1[cnt] == '<') {
      cout << 0 << endl;
    } else {
      temp = 0;
      for (int i = 0; i < n; i++) {
        if (str[i] == '<') {
          temp++;
        } else {
          break;
        }
      }
      ans = temp;
      temp = 0;
      for (int i = n - 1; i >= 0; i--) {
        if (str[i] == '>') {
          temp++;
        } else {
          break;
        }
      }
      cout << min(ans, temp) << endl;
    }
  }
  return 0;
}
