Description

deepl翻译

有一个网格，由 $2$ 行和 $n$ 列组成。行的编号从上到下从 $1$ 到 $2$ 。列的编号从左到右依次为 $1$ 至 $n$ 。网格的每个单元格都包含一个箭头，指向左边或右边。没有箭头指向网格外。

有一个机器人从 $(1, 1)$ 格开始。每隔一秒钟，下面两个动作会相继发生：

1. 首先，机器人向左、向右、向下或向上移动（不能试图移动到网格外，也不能跳过移动）；
2. 然后，机器人沿着放置在当前单元格中的箭头移动（移动后最终到达的单元格）。

您的任务是判断机器人能否到达 $(2, n)$ 单元格。

Input

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

The first line of each test case contains a single integer ($2 \le n \le 2 \cdot 10^5$).

The second line contains a string consisting of exactly $n$ characters < and/or > — the first row of the grid.

The third line contains a string consisting of exactly $n$ characters < and/or > — the second row of the grid.

Additional constraints on the input:

• $n$ is even;
• there are no arrows pointing outside the grid;
• the sum of $n$ over all test cases doesn't exceed $2 \cdot 10^5$.

Output

For each test case, print YES if the robot can reach the cell $(2, n)$; otherwise, print NO.

You can print each letter in any case. For example, yes, Yes, YeS will all be recognized as positive answer.

4
4
>><<
>>><
2
><
><
4
>>><
>><<
6
>><<><
><>>><

YES
YES
NO
YES

Note

In the first example, one of the possible paths looks as follows: $(1, 1) \rightarrow (1, 2) \rightarrow (1, 3) \rightarrow (2, 3) \rightarrow (2, 4)$.

In the second example, one of the possible paths looks as follows: $(1, 1) \rightarrow (2, 1) \rightarrow (2, 2)$.

In the third example, there is no way to reach the cell $(2, 4)$.

In the fourth example, one of the possible paths looks as follows: $(1, 1) \rightarrow (2, 1) \rightarrow (2, 2) \rightarrow (1, 2) \rightarrow (1, 3) \rightarrow (2, 3) \rightarrow (2, 4) \rightarrow (2, 5) \rightarrow (2, 6)$.