Computer Game

Monocarp is playing a computer game. Now he wants to complete the first level of this game.

A level is a rectangular grid of 2 rows and nnn columns. Monocarp controls a character, which starts in cell (1,1)— at the intersection of the 1-st row and the 1-st column.

Monocarp's character can move from one cell to another in one step if the cells are adjacent by side and/or corner. Formally, it is possible to move from cell (x1,y1)to cell (x2,y2)in one step if ∣x1−x2∣≤1and ∣y1−y2∣≤1. Obviously, it is prohibited to go outside the grid.

There are traps in some cells. If Monocarp's character finds himself in such a cell, he dies, and the game ends.

To complete a level, Monocarp's character should reach cell (2,n) — at the intersection of row 222 and column nnn.

Help Monocarp determine if it is possible to complete the level.

Input

The first line contains a single integer t(1≤t≤100) — the number of test cases. Then the test cases follow. Each test case consists of three lines.

The first line contains a single integer n(3≤n≤100) — the number of columns.

The next two lines describe the level. The iii-th of these lines describes the iii-th line of the level — the line consists of the characters '0' and '1'. The character '0' corresponds to a safe cell, the character '1' corresponds to a trap cell.

Additional constraint on the input: cells (1,1)and (2,n)are safe.

Ouput

For each test case, output YES if it is possible to complete the level, and NO otherwise.

Example

Input

4
3
000
000
4
0011
1100
4
0111
1110
6
010101
101010

Output

YES
YES
NO
YES

Note

Consider the example from the statement.

In the first test case, one of the possible paths is (1,1)→(2,2)→(2,3)

In the second test case, one of the possible paths is (1,1)→(1,2)→(2,3)→(2,4)

In the fourth test case, one of the possible paths is (1,1)→(2,2)→(1,3)→(2,4)→(1,5)→(2,6)

思路：

这个是比较典型的搜索题目，起点和终点都已经确定了，只要进行上下左右以及斜方的探索，并存储在结构中就可以了。

#include<iostream>
#include<string.h>
using namespace std;
#define N 110
char v[2][N]={'0'};
int d[8][2]={{0,1},{1,0},{0,-1},{-1,0},{1,1},{-1,-1},{1,-1},{-1,1}};
struct point
{
	int x;
	int y;
}point[40000];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,tx,ty;
		scanf("%d",&n);
		for(int i=0;i<2;i++)
			scanf("%s",v[i]);
		int head=1,tail=1,x=1,y=1;
		char ch='0';
		v[1-1][1-1]=ch+2;
		point[tail].x =1;
		point[tail].y =1;
		tail++;
		while(head<tail)
		{
			int x=point[head].x ,
				y=point[head].y ;
			if(x==2&&y==n)
			{
				printf("YES\n");
				break;
			}
			for(int k=0;k<8;k++)
			{
				tx=x+d[k][0];
				ty=y+d[k][1];
				if(tx>0&&tx<=n&&ty>0&&ty<=n&&v[tx-1][ty-1]==ch)
				{
					v[tx-1][ty-1]=ch+2;
					point[tail].x =tx;
					point[tail].y =ty;
					tail++;
				}
			}
			head++;
		}
		if(v[1][n-1]!=ch+2)
			printf("NO\n");
	}
	return 0;
}