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.lang.reflect.Type;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Prob2
 //       extends Print
{

    public static void main(String[] args) {
        Scanner scanner =new Scanner(System.in);

        int testcases=scanner.nextInt();

        for(int i=0;i<testcases;i++){
            scanner.next();
            String s=scanner.next();
            String s1=new String(s);
            String s2=new String(s);
            while(s1.contains("><"))
            s1=s1.replace("><",">");

            while(s2.contains("><"))
            s2=s2.replace("><","<");


            int count1=0;
            for (int j=0;j<s1.length();j++)if(s1.charAt(j)=='>')count1++;

            int ans1=Math.min(count1,s1.length()-count1);

            int count2=0;
            for (int j=0;j<s2.length();j++)if(s2.charAt(j)=='>')count2++;

            int ans2=Math.min(count2,s2.length()-count2);

            System.out.println(Math.min(ans1,ans2));



        }


    }
}
