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: #CA3SAR KA JAADOOO
  from sys import stdin,stdout,setrecursionlimit
  from io import BytesIO, IOBase
  # import math
  # from math import gcd,floor,sqrt,ceil
  # from collections import Counter,deque
  # from itertools import accumulate as acc,permutations as perm
  # from bisect import bisect_left as bl,bisect_right as br,bisect as bis
   
  setrecursionlimit(10000)
   
  class FastIO(IOBase):
      newlines = 0
   
      def __init__(self, file):
          import os
          self.os = os
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
          self.BUFSIZE = 8192
   
      def read(self):
          while True:
              a = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, self.BUFSIZE))
              if not a:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(a), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
   
      def readline(self):
          while self.newlines == 0:
              a = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, self.BUFSIZE))
              self.newlines = a.count(b"\n") + (not a)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(a), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
   
      def flush(self):
          if self.writable:
              self.os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
   
   
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
   
   
  stdin, stdout = IOWrapper(stdin), IOWrapper(stdout)
  input = lambda: stdin.readline().rstrip("\r\n")
   
  # inf = float('inf')
  # ninf = float('-inf')
  # abc = 'abcdefghijklmnopqrstuvwxyz'
  inp = lambda: int(input())
  st = lambda: input().strip()
  jn = lambda x,l: x.join(map(str,l))
  int_arr = lambda : list(map(int,input().strip().split()))
  str_arr = lambda :list(map(str,input().split()))
  get_str = lambda : map(str,input().strip().split())
  get_int = lambda: map(int,input().strip().split())
  get_float = lambda : map(float,input().strip().split())
   
  mod = 1000000007
  
  for _ in range(inp()):
      n=inp()
      a=st()
      b=st()
      f=0
      for i in range(n):
          if a[i]=='1' and b[i]=='1':
              print('NO')
              f=1
              break
      if f==0:
          print('YES')
  