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.*;
  //solve harder problems
  //upsolve
  //use gitgud
  //learn from everything
  //USACO
  public class Contest1598B
  {
  	static class InputReader {
  		BufferedReader reader;
  		StringTokenizer tokenizer;
  		public InputReader(InputStream stream) {
  			reader = new BufferedReader(new InputStreamReader(stream), 32768);
  			tokenizer = null;
  		}
  		String next() { // reads in the next string
  			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
  				try {
  					tokenizer = new StringTokenizer(reader.readLine());
  				} catch (IOException e) {
  					throw new RuntimeException(e);
  				}
  			}
  			return tokenizer.nextToken();
  		}
  		public int nextInt() { // reads in the next int
  			return Integer.parseInt(next());
  		}
  		public long nextLong() { // reads in the next long
  			return Long.parseLong(next());
  		}
  		public double nextDouble() { // reads in the next double
  			return Double.parseDouble(next());
  			}
  		}
  	static InputReader r = new InputReader(System.in);
  	static PrintWriter pw = new PrintWriter(System.out);
  	public static void main(String[] args)
  	{
  		//DOES BINARY SEARCH WORK ALWAYS LOOK FOR MONOTONIC STUFF
  		//LOOK FOR INT OVERFLOW
  		//LOOK FOR SCOPE ERROR
  		//Add negatives
  		//SORT BOTH ARRAYS
  		//CHECK THE LAST ONE THAT IS OUT LOOP
  		//SORT BY BOTH VALUES
  		//DON'T ADD STRINGS,USE STRING BUILDER
  		int t = r.nextInt();
  		while (t > 0)
  		{
  			t--;
  			int n = r.nextInt();
  			String s1 = r.next();
  			String s2  =r.next();
  			boolean flag = false;
  			for (int i = 0; i< n; i ++)
  			{
  				if ((s1.charAt(i) == '0'|| s2.charAt(i) == '0') == false)
  				{
  					flag = true;
  					break;
  				}
  			}
  			pw.println(flag ? "No" : "yes");
  		}
  		
  		pw.close();
  	}
  }