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: /*===============================
  Author   :   Shadman Shariar   ||
  ===============================*/
  import java.io.*;
  import java.util.*;
  //import java.math.BigInteger;
  //import java.text.DecimalFormat;
  public class Main {
  public static Main obj = new Main();
  public static int [] dx = {-1, 1, 0, 0, -1, -1, 1, 1};
  public static int [] dy = {0, 0, -1, 1, -1, 1, -1, 1};
  public static final long mod = 1000000007;
  //public static FastReader fr = new FastReader();
  //public static Scanner input = new Scanner(System.in);
  //public static PrintWriter pw = new PrintWriter(System.out);
  //public static DecimalFormat df = new DecimalFormat(".000");
  //public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  public static void main (String[] args) throws Exception{Scanner input=new Scanner(System.in);
  //===========================================================================================//
  //BigInteger bi = new BigInteger("000");
  //StringBuilder sb = new StringBuilder();
  //StringBuffer sbf = new StringBuffer();
  //StringTokenizer st = new StringTokenizer("string","split");
  //Vector vc = new Vector();
  //ArrayList<Integer> al= new ArrayList<Integer>();
  //LinkedList<Integer> ll= new LinkedList<Integer>();
  //Stack <Integer> stk = new Stack <Integer>();
  //Queue <Integer> q = new LinkedList<Integer>();
  //ArrayDeque<Integer> ad = new ArrayDeque<Integer>();
  //PriorityQueue <Integer> pq = new PriorityQueue<Integer>();
  //PriorityQueue <Integer> pqr = new PriorityQueue<Integer>(Comparator.reverseOrder());
  //HashSet<Integer> hs = new HashSet<Integer>();
  //LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>();
  //TreeSet<Integer> ts = new TreeSet<Integer>();
  //TreeSet<Integer> tsr = new TreeSet<Integer>(Comparator.reverseOrder());
  //Hashtable<Integer,Integer> ht = new Hashtable<Integer,Integer>();
  //HashMap<Integer,Integer> hm = new HashMap<Integer,Integer>();
  //LinkedHashMap<Integer,Integer> lhm = new LinkedHashMap<Integer,Integer>();
  //TreeMap<Integer,Integer> tm = new TreeMap<Integer,Integer>();
  //TreeMap<Integer,Integer> tmr = new TreeMap<Integer,Integer>(Comparator.reverseOrder());
  //LinkedList<Integer> adj[] = new LinkedList[size];
  //===========================================================================================//
  
   int t = input.nextInt();
   
   for (int i = 0; i < t; i++) {
  	
  	 int n = input.nextInt();
  	 
  	 
  	 String s = input.next();
  	 
  	 String s2 = input.next();
  	 
  	 
  	 int c= 0;
  	 for (int j = 0; j < s.length(); j++) {
  		
  		 if((s.charAt(j)=='1')&&(s2.charAt(j)=='1')) {
  			 c++;
  			 break;
  		 }
  		 
  		 
  	}
  	 
  	 if(c==0)System.out.println("YES");
  	 else System.out.println("NO");
  }
   
  
  
  
  
  //===========================================================================================//
        //pw.flush();
        //pw.close();
        input.close();
        System.exit(0);
  }
  //===========================================================================================//
  
  }