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 n 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 (x_1, y_1) to cell (x_2, y_2) in one step if |x_1 - x_2| ≤ 1 and |y_1 - y_2| ≤ 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 2 and column n.

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 i-th of these lines describes the i-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.

Output

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).
1
9
000000010
000000000
 1
9
000000010
000100000
 1
60
000000000000000000000000000000000000000000000000000000000010
000000000000000000000000000000000000000000000000000000000010

YES
 YES
 NO

// package codeforces;

import java.io.*;
import java.util.*;

public class Contest_educational115_div2 {
	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	private static String next() throws IOException {

		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
	}

	static BufferedReader br;
	static StringTokenizer st;
	static BufferedWriter bw ;
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		bw = new BufferedWriter(new OutputStreamWriter(System.out));
		int t=nextInt();
		while(t-->0) {
			computer_game();
		}
		bw.close();
	}
	
	public static void computer_game() throws IOException{
		int n=nextInt();
		int[][]arr=new int[2][n];
		String str1=next();
		String str2=next();
		for(int i=0;i<n;i++) {
			arr[0][i]=str1.charAt(i)-'0';
		}
		for(int i=0;i<n;i++) {
			arr[1][i]=str2.charAt(i)-'0';
		}
		boolean b=true;
		for(int i=0;i<n;i++) {
			if(arr[0][i]==1 && arr[1][i]==1) {
				b=false;
				break;
			}
		}
		if(b) {
			bw.append("YES\n");
		}else {
			bw.append("NO\n");
		}
		
	}
	public static boolean computer_recurr(int[][]arr,int x,int y) {
		if(x<2 && y<arr.length && arr[x][y]==1) {
			System.out.println(x+" "+y);
			return false;
		}
		if(x==1 && y==arr.length-1) {
			return true;
		}
		if(y>=arr.length) {
			return false;
		}
		boolean a=false,b=false,c=false;
		if(x==0) {
			a=computer_recurr(arr, x+1, y+1);
		}
		if(x==1) {
			b=computer_recurr(arr, x-1, y+1);
		}
		c=computer_recurr(arr, x, y+1);
		boolean ans=a||b||c;
		System.out.println(ans+" "+x+" "+y);
		return a||b||c;
	}
	
}




