CF1140B.Good String

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.

你有一个长度为 $n$ 的字符串 $s$，仅由字符 > 和 < 组成。你可以对这个字符串执行若干次操作；每次操作中，你必须选择字符串中仍存在的某个字符。若你选择的字符是 >，则其后紧邻的字符将被删除（若所选字符是字符串的最后一个字符，则不发生任何变化）；若你选择的字符是 <，则其前紧邻的字符将被删除（若所选字符是字符串的第一个字符，则不发生任何变化）。

例如，在字符串 > > < > 中选择字符 >，字符串将变为 > > >；在字符串 > < 中选择字符 <，字符串将变为 <。

若存在某种操作序列，使得执行完该序列后字符串中仅剩一个字符，则称该字符串是“好的”。例如，字符串 >、> > 都是“好的”。

在执行上述操作之前，你可以从给定字符串中删除任意数量的字符（可以不删，也可以最多删去 $n - 1$ 个字符，但不能全部删光）。你需要计算：为使字符串 $s$ 变为“好的”，至少需要删除多少个字符。

The first line contains one integer $t$ ($1 \le t \le 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 \le n \le 100$) – the length of string $s$.

The second line of $i$-th test case contains string $s$, consisting of only characters > and <.

第一行包含一个整数 $t$（$1 \le t \le 100$），表示测试用例的数量。每个测试用例由两行组成。

第 $i$ 个测试用例的第一行包含一个整数 $n$（$1 \le n \le 100$），表示字符串 $s$ 的长度。

第 $i$ 个测试用例的第二行包含字符串 $s$，其仅由字符 > 和 < 组成。

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.

对每个测试用例输出一行。

对第 $i$ 个测试用例，输出从字符串 $s$ 中删除的最少字符数，使得 $s$ 变为“好”字符串。

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: > < < $\rightarrow$ < < $\rightarrow$ <.

在第一个测试用例中，我们可以删除字符串 <> 中的任意一个字符。

在第二个测试用例中，我们无需删除任何字符。字符串 \><< 是合法的，因为我们可执行如下操作序列：\><< $\rightarrow$ << $\rightarrow$ <。