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: > < < → < < → <.
import java.util.Scanner;

public class Solution{
       
       public static void main(String args[]){
              
              Scanner sc=new Scanner(System.in);
              int t=sc.nextInt();
              
              for(int i=0;i<t;i++){
                     int n=sc.nextInt();
                     String s=sc.next();
                     
                     find(s);
              }
       }
       public static void find(String s){
              
              if(s.charAt(0)=='>')
                     System.out.println("0");
              else if(s.charAt(s.length()-1)=='<')
                     System.out.println("0");
              else{
                     int fast=1,last=1;
                     int i=1,j=s.length()-2;
                     
                     while(i<s.length()-1){
                            if(s.charAt(i)=='<'){
                                   fast++;
                                   i++;
                            }
                            else
                                   break;
                     }
                     while(j>=0){
                            if(s.charAt(j)=='>'){
                                   last++;
                                   j--;
                            }
                            else
                                   break;
                     }
                     if(fast<last)
                            System.out.println(fast);
                     else
                            System.out.println(last);
              }
       }
}