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;
void fileIO() {}
bool sortbysecdesc(const pair<long long, long long> &a,
                   const pair<long long, long long> &b) {
  return a.second > b.second;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  fileIO();
  long long T;
  T = 1;
  cin >> T;
  while (T--) {
    long long n;
    cin >> n;
    string s;
    cin >> s;
    long long start = s[0];
    long long end = s[n - 1];
    bool first = true, second = true;
    if (start == '<') first = false;
    if (end == '>') second = false;
    if (!first) {
      for (long long i = 1; i < n; i++) {
        if (s[i] == '<') first = true;
      }
    }
    if (!second) {
      for (long long i = 0; i < n - 1; i++) {
        if (s[i] == '>') second = true;
      }
    }
    if (start == '<' && end == '>') {
      if (!first && !end) {
        cout << 1 << "\n";
      } else if (first && end) {
        long long cnt1 = 0, cnt2 = 0;
        for (long long i = 0; i < n; i++) {
          if (s[i] == '>') break;
          cnt1++;
        }
        for (long long i = n - 1; i >= 0; i--) {
          if (s[i] == '<') break;
          cnt2++;
        }
        cout << min(cnt1, cnt2) << "\n";
      } else
        cout << 1 << "\n";
    } else
      cout << 0 << "\n";
  }
  return 0;
}
