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: > < < → < < → <.
//package codeforce;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;

public class Good_String {
    public static void main(String []args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(bf.readLine());

        while(t > 0){
            int n = Integer.parseInt(bf.readLine());
            String input = bf.readLine();
            int deletion = getDeletion(input);
            System.out.println(deletion);
            t--;
        }

    }
    public static int getDeletion(String input){
        Stack<Character> stk = new Stack<>();
        /*StringBuilder sb = new StringBuilder();
        for(int i=0; i < input.length(); i++){
            if(i == 0){
                sb.append(input.charAt(i));
            }
            else if( input.charAt(i) != input.charAt(i-1)){
                sb.append(input.charAt(i));
            }
        }
        input = sb.toString();*/
        for(int i=0 ; i < input.length(); i++){
            while(!stk.isEmpty() && input.charAt(i) == '<'){
                stk.pop();
            }
            stk.push(input.charAt(i));
        }
        if(stk.size() == 1) return 0;

        Stack<Character> stk2 = new Stack<>();
        for(int i=input.length()-1 ; i >= 0; i--){
            while(!stk2.isEmpty() && input.charAt(i) == '>'){
                stk2.pop();
            }
            stk2.push(input.charAt(i));
        }
        if(stk2.size() == 1) return 0;
        return Math.min(stk.size()-1, stk2.size()-1);
    }
}
