B'There is a grid, consisting of 2 rows and n columns. The rows are numbered from 1 to 2 from top to bottom. The columns are numbered from 1 to n from left to right. Each cell of the grid contains an arrow pointing either to the left or to the right. No arrow points outside the grid. There is a robot that starts in a cell (1, 1) . Every second, the following two actions happen one after another: Your task is to determine whether the robot can reach the cell (2, n) . The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains a single integer ( 2 <= n <= 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: 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. 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) . '...