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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Collectors;

/*
 * 
 * @author harshpant
 * A tricky question due to the language in which it was specified.
 */

public class GoodString {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int t = scanner.nextInt();
		while(t > 0) {
			int len = scanner.nextInt();
			String input = scanner.next();
			System.out.println(Math.min
					(rDistance(input, '>'), lDistance(input, '<')));
			t--;
		}
	
	}
	
	public static int rDistance(String s, char c) {
		int l = s.length();
		int i = 0;
		while(i<s.length() && s.charAt(i)!=c) {
			i++;
		}
		int k = i;
		if(i == s.length()) {
			return i - 1;
		}
		else {
			return i ;
		}
	}
	
	public static int lDistance(String s, char c) {
		int i = s.length() - 1;
		while(i>0 && s.charAt(i)!=c) {
			i--;
		}
		int k = s.length()-i;
		if(i == 0) {
			return s.length()-1;
		}
		else {
			return s.length() - i -1;
		}
		
	}
	
}
