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 Main {
    public static void main(String[] args) {
        try (PrintWriter out = new PrintWriter(System.out)) {
            Solution solution = new Solution();
            solution.in = new InputReader(getInput());
            solution.out = out;
            solution.solve();
        }
    }

    static InputStream getInput() {
        String inputFile = getInputFileName();
        if (inputFile == null) {
            return System.in;
        }
        try {
            return new FileInputStream(Main.class.getClassLoader().getResource(inputFile).getFile());
        } catch (FileNotFoundException e) {
            throw new RuntimeException(e);
        }
    }

    static String getInputFileName() {
        try {
            return System.getProperty("compet.input");
        } catch (Exception ex) {
            return null;
        }
    }
}

class Solution {
    InputReader in;
    PrintWriter out;

    int cntPef(String s, char ch) {
        int i = 0;
        while (i < s.length() && s.charAt(i) == ch) {
            i++;
        }
        return i;
    }

    void solveCase() {
        int n = in.nextInt();
        String s = in.next();
        int ans = Math.min(cntPef(s, '<'), cntPef(new StringBuilder().append(s).reverse().toString(), '>'));
        out.println(ans);
    }

    void solve() {
        int t = in.nextInt();
        for (int tc = 0; tc < t; tc++) {
            solveCase();
        }
    }
}

class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }
}
