CF1791B.Following Directions

Alperen is standing at the point $(0,0)$. He is given a string $s$ of length $n$ and performs $n$ moves. The $i$-th move is as follows:

• if $s_i = \texttt{L}$, then move one unit left;
• if $s_i = \texttt{R}$, then move one unit right;
• if $s_i = \texttt{U}$, then move one unit up;
• if $s_i = \texttt{D}$, then move one unit down.

If Alperen starts at the center point, he can make the four moves shown.

There is a candy at $(1,1)$ (that is, one unit above and one unit to the right of Alperen's starting point). You need to determine if Alperen ever passes the candy.

Alperen's path in the first test case.

阿尔佩伦站在点 $(0,0)$ 处。他获得一个长度为 $n$ 的字符串 $s$，并执行 $n$ 次移动。第 $i$ 次移动规则如下：

• 若 $s_i = \texttt{L}$，则向左移动一个单位；
• 若 $s_i = \texttt{R}$，则向右移动一个单位；
• 若 $s_i = \texttt{U}$，则向上移动一个单位；
• 若 $s_i = \texttt{D}$，则向下移动一个单位。

若阿尔佩伦从中心点出发，可执行图中所示的四种移动。

在点 $(1,1)$（即阿尔佩伦起始点正上方一个单位、正右方一个单位处）有一颗糖果。你需要判断阿尔佩伦在移动过程中是否曾经过该糖果所在位置。

第一个测试用例中阿尔佩伦的路径。

The first line of the input contains an integer $t$ ($1 \leq t \leq 1000$) — the number of testcases.

The first line of each test case contains an integer $n$ ($1 \leq n \leq 50$) — the length of the string.

The second line of each test case contains a string $s$ of length $n$ consisting of characters $\texttt{L}$, $\texttt{R}$, $\texttt{D}$, and $\texttt{U}$, denoting the moves Alperen makes.

输入的第一行包含一个整数 $t$（$1 \leq t \leq 1000$）——测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 50$）——字符串的长度。

每个测试用例的第二行包含一个长度为 $n$ 的字符串 $s$，由字符 $\texttt{L}$、$\texttt{R}$、$\texttt{D}$ 和 $\texttt{U}$ 组成，表示 Alperen 所做的移动。

For each test case, output "YES" (without quotes) if Alperen passes the candy, and "NO" (without quotes) otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

对于每个测试用例，如果阿尔佩伦传递了糖果，则输出 "YES"（不带引号）；否则输出 "NO"（不带引号）。

你可以以任意大小写形式输出答案（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均会被识别为肯定回答）。

In the first test case, Alperen follows the path $$(0,0) \overset{\texttt{U}}{\to} (0,1) \overset{\texttt{U}}{\to} (0,2) \overset{\texttt{U}}{\to} (0,3) \overset{\texttt{R}}{\to} (1,3) \overset{\texttt{D}}{\to} (1,2) \overset{\texttt{D}}{\to} \color{green}{\mathbf{(1,1)}} \overset{\texttt{L}}{\to} (0,1).$$ Note that Alperen doesn't need to end at the candy's location of $(1,1)$, he just needs to pass it at some point.

In the second test case, Alperen follows the path $$(0,0) \overset{\texttt{U}}{\to} (0,1) \overset{\texttt{R}}{\to} \color{green}{\mathbf{(1,1)}}.$$

In the third test case, Alperen follows the path $$(0,0) \overset{\texttt{R}}{\to} (1,0) \overset{\texttt{R}}{\to} (2,0) \overset{\texttt{R}}{\to} (3,0) \overset{\texttt{U}}{\to} (3,1) \overset{\texttt{U}}{\to} (3,2) \overset{\texttt{D}}{\to} (3,1) \overset{\texttt{D}}{\to} (3,0) \overset{\texttt{D}}{\to} (3,-1).$$

In the fourth test case, Alperen follows the path $$(0,0) \overset{\texttt{L}}{\to} (-1,0) \overset{\texttt{L}}{\to} (-2,0) \overset{\texttt{L}}{\to} (-3,0).$$

在第一个测试用例中，阿尔佩伦遵循路径

$$(0,0) \overset{\texttt{U}}{\to} (0,1) \overset{\texttt{U}}{\to} (0,2) \overset{\texttt{U}}{\to} (0,3) \overset{\texttt{R}}{\to} (1,3) \overset{\texttt{D}}{\to} (1,2) \overset{\texttt{D}}{\to} \color{green}{\mathbf{(1,1)}} \overset{\texttt{L}}{\to} (0,1).$$

注意：阿尔佩伦无需最终停在糖果所在位置 $(1,1)$，他只需在某个时刻经过该点即可。

在第二个测试用例中，阿尔佩伦遵循路径

$$(0,0) \overset{\texttt{U}}{\to} (0,1) \overset{\texttt{R}}{\to} \color{green}{\mathbf{(1,1)}}.$$

在第三个测试用例中，阿尔佩伦遵循路径

$$(0,0) \overset{\texttt{R}}{\to} (1,0) \overset{\texttt{R}}{\to} (2,0) \overset{\texttt{R}}{\to} (3,0) \overset{\texttt{U}}{\to} (3,1) \overset{\texttt{U}}{\to} (3,2) \overset{\texttt{D}}{\to} (3,1) \overset{\texttt{D}}{\to} (3,0) \overset{\texttt{D}}{\to} (3,-1).$$

在第四个测试用例中，阿尔佩伦遵循路径

$$(0,0) \overset{\texttt{L}}{\to} (-1,0) \overset{\texttt{L}}{\to} (-2,0) \overset{\texttt{L}}{\to} (-3,0).$$