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

    /*
     * To change this license header, choose License Headers in Project Properties.
     * To change this template file, choose Tools | Templates
     * and open the template in the editor.
     */
    
    import java.util.*;
    import java.util.Arrays;


    /**
     *
     * @author DELL
     */
      public class solution{

               static long power(long n,long ans){
                   if(n==0)return ans;
                   return ans=power(n-1,ans)*2;
               }
               static boolean prime(int n){
                   for(int i=2;i*i<=n;i++){
                       if(n%i==0)return false;
                   }
                   return true;
               }
               static long power(long x, int y, int p)
                {
                  long res = 1; // Initialize result

                  x = x % p; // Update x if it is more than or
                  // equal to p

                  if (x == 0)
                    return 0; // In case x is divisible by p;

                  while (y > 0)
                  {

                    // If y is odd, multiply x with result
                    if ((y & 1) != 0)
                      res = (res * x) % p;

                    // y must be even now
                    y = y >> 1; // y = y/2
                    x = (x * x) % p;
                  }
                  return res;
                }
               static int gcd(int a,int b)
                {
                    if(b%a==0)
                    return a;
                    return gcd(b%a,a);
                }

        public static void main(String[] args) {
             Scanner sc=new Scanner(System.in);
             StringBuilder sb=new StringBuilder();
             int t=sc.nextInt();
             while(t-->0){
                 int n=sc.nextInt();
                 char a[][]=new char[2][n];
                 for(int i=0;i<2;i++){
                     String s=sc.next();
                     for(int j=0;j<n;j++){
                         a[i][j]=s.charAt(j);
                     }
                 }
                 boolean b=false;
                 for(int j=0;j<n;j++){
                     if(a[0][j]=='1' && a[1][j]=='1'){
                         b=true;
                         break;
                     }
                 }
                 if(b)System.out.println("NO");
                 else System.out.println("YES");
             }
             //System.out.println(sb);
        }

    }
