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.*;
import java.util.*;

public class Contest {

	public static class Pair implements Comparable<Pair> {
		int x, y;

		public Pair(int a, int b) {
			x = a;
			y = b;
		}

		@Override
		public int compareTo(Pair o) {
			if (y == o.y)
				return x - o.x;
			return y - o.y;
		}

		@Override
		public String toString() {
			// TODO Auto-generated method stub
			return x + " " + y;
		}
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
//		int k = Integer.parseInt(st.nextToken());
//		PriorityQueue<Pair> p = new PriorityQueue<>(Collections.reverseOrder());
//		for (int i = 0; i < n; i++) {
//			st = new StringTokenizer(br.readLine());
//			int x = Integer.parseInt(st.nextToken());
//			int y = Integer.parseInt(st.nextToken());
//			Pair temp = new Pair(x, y);
//			p.add(temp);
//		}
//		int max = 0;
//		int l = 0;
//		for (int i = 0; i < k; i++) {
//			l += p.peek().x;
//			max = Math.max(max, l * p.poll().y);
//		}
		while(n-->0) {
			int k =Integer.parseInt(br.readLine());
			char[]s= br.readLine().toCharArray();
			int ans=0;
			if (s[0]=='<'&&s[k-1]=='>') {
				int l=0;
				for(int i=0;i<k;i++) {
					if (s[i]=='>') {
						break;
					}
					l++;
				}
				int r=0;
				for(int i=k-1;i>=0;i--) {
					if (s[i]=='<') {
						break;
					}
					r++;
				}
				ans=Math.min(l, r);
			}
		System.out.println(ans);	
		}
		
	}
}