You have a string s of length n consisting of only characters > and <. You may do some operations with this string, for each operation you have to choose some character that still remains in the string. If you choose a character >, the character that comes right after it is deleted (if the character you chose was the last one, nothing happens). If you choose a character <, the character that comes right before it is deleted (if the character you chose was the first one, nothing happens).

For example, if we choose character > in string > > < >, the string will become to > > >. And if we choose character < in string > <, the string will become to <.

The string is good if there is a sequence of operations such that after performing it only one character will remain in the string. For example, the strings >, > > are good. 

Before applying the operations, you may remove any number of characters from the given string (possibly none, possibly up to n - 1, but not the whole string). You need to calculate the minimum number of characters to be deleted from string s so that it becomes good.

Input

The first line contains one integer t (1 ≤ t ≤ 100) – the number of test cases. Each test case is represented by two lines.

The first line of i-th test case contains one integer n (1 ≤ n ≤ 100) – the length of string s.

The second line of i-th test case contains string s, consisting of only characters > and <.

Output

For each test case print one line.

For i-th test case print the minimum number of characters to be deleted from string s so that it becomes good.

Example

Input


3
2
&lt;&gt;
3
&gt;&lt;&lt;
1
&gt;


Output


1
0
0

Note

In the first test case we can delete any character in string <>.

In the second test case we don't need to delete any characters. The string > < < is good, because we can perform the following sequence of operations: > < < → < < → <.
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, MAXN = 2e5 + 5;
int T, N, M, K, Q, A[MAXN], B[MAXN];
string S;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
void fillA() {
  for (int i = 0; i < N; ++i) cin >> A[i];
}
long long fast_pow(long long b, long long e) {
  long long ans = 1;
  while (e > 0) {
    if (e & 1) ans = (ans * b) % MOD;
    e >>= 1;
    b = (b * b) % MOD;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  cin >> T;
  while (T--) {
    cin >> N >> S;
    int l = N;
    if (l == 1 or !(S[0] == '<' and S[l - 1] == '>')) {
      cout << 0 << '\n';
      continue;
    }
    int x, y;
    for (int i = 0; i < l; ++i)
      if (S[i] == '>') {
        x = i;
        break;
      }
    for (int i = l - 1; i > -1; --i)
      if (S[i] == '<') {
        y = i;
        break;
      }
    cout << min(x, l - y - 1) << '\n';
  }
  return 0;
}
