description: 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).
solution: 
  import java.io.*;
  import java.util.*;
  
  
  import java.io.*;
  import java.io.*;
  import java.util.*;
  import java.math.*;
  
  import static java.lang.Math.sqrt;
  import static java.lang.Math.floor;
  import java.io.*;
  import java.util.*;
  import java.io.*;
  import java.util.*;
  import java.util.*;
  
  
  
  public class codeforces {
  
           static boolean possible (int [][]mat, int r, int c, int n, boolean [][]vis) {
          	 if(r <= 0 || c <= 0 || r > 2 || c > n )return false;
          	 if(r == 2 && c == n)return true;
          	 
          	 if(vis[r][c])return false;
          	 vis[r][c] = true;
          	 if(mat[r][c] == 1)return false;
          	 
          	 boolean a = possible(mat,r+1,c,n,vis);
          	 boolean b = possible(mat,r,c+1,n,vis);
          	 boolean d = possible(mat,r+1,c+1,n,vis);
          	 boolean e = possible(mat,r-1,c+1,n,vis);
          	 
          	 return a || b || d || e;
           }
       
         
  	 	   		public static void main(String args[])throws IOException {
  	        	   			 
  	 
  	 	  		 BufferedReader ob = new BufferedReader(new InputStreamReader(System.in));
  	 	  		 BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
  	 			 
  	 	  			int t = Integer.parseInt(ob.readLine());
  	 	  			
  	 	  			while(t --> 0) {
   	  			 int num = Integer.parseInt(ob.readLine());
  		 	  		int [][]mat = new int[3][num+1];
  		 	  		 String sssss = ob.readLine();
  		 	  		String string = ob.readLine();
  		 	  		
  		 	  	   for(int i = 1; i <= num; i++) {
  		 	  		   if(sssss.charAt(i-1) == '0') {
  		 	  			   mat[1][i] = 0;
  		 	  		   }else {
  		 	  			   mat[1][i] = 1;
  		 	  		   }
  		 	  	   }
  		 	  	 for(int i = 1; i <= num; i++) {
  		 	  		   if(string.charAt(i-1) == '0') {
  		 	  			   mat[2][i] = 0;
  		 	  		   }else {
  		 	  			   mat[2][i] = 1;
  		 	  		   }
  		 	  	   }
  		 	  	 
  		 	  	 boolean [][]vis = new boolean[3][num+1];
  		 	  	 boolean ans = possible(mat,1,1,num,vis);
  		 	  	 System.out.println(ans == true?"YES":"NO");
  		 	  		 }
  		 	   		
  	 	   		}
  }
  	
  	    		    			
  	    		    			