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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.StringJoiner;
import java.util.stream.IntStream;
//import java.util.Arrays;

public class A {
 
	public static FastScanner fs = new FastScanner();
 
	public static void main(String[] args) {
		int t = fs.nextInt();
		for (int tc = 0; tc < t; tc++){
			solve();
		}
	}
	
	public static void solve(){
		int n = fs.nextInt(), res = 0, var = 0;
		String S = fs.next();
		if (n == 1){
			System.out.println(0);
			return ;
		}
		for (int i = n-1; i >=0 ; i--){
			char x = S.charAt(i);
			if (x == '<'){
				break;
			}else{
				var ++;
			}
		}
		res = Math.max(res , var);
		var = 0;
		for (int i = 0; i< n; i++){
			char x = S.charAt(i);
			if (x == '>'){
				break;
			}else{
				var ++;
			}
		}
		res = Math.min(res, var);
		System.out.println(res);
	}
		
	static void array_space(int[] A){
		StringJoiner sj = new StringJoiner(" ");
		IntStream.of(A).forEach(x -> sj.add(String.valueOf(x)));
		System.out.println(sj.toString());
	}
	
	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}
	
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}