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: def main():
      alpha = 'abcdefghijklmnopqrstuvwxyz'
      ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
      inf = 1e17
      mod = 10 ** 9 + 7
  
      # Max = 10 ** 6
      # primes = []
      # prime = [True for i in range(Max + 1)]
      # p = 2
      # while (p * p <= Max + 1):
      #
      #     # If prime[p] is not
      #     # changed, then it is a prime
      #     if (prime[p] == True):
      #
      #         # Update all multiples of p
      #         for i in range(p * p, Max + 1, p):
      #             prime[i] = False
      #     p += 1
      #
      # for p in range(2, Max + 1):
      #     if prime[p]:
      #         primes.append(p)
  
      #print(len(primes))
  
  
      def factorial(n):
          f = 1
  
          for i in range(1, n + 1):
              f = (f * i) % mod  # Now f never can
          # exceed 10^9+7
  
          return f
  
      def ncr(n, r):
          # initialize numerator
          # and denominator
          num = den = 1
          for i in range(r):
              num = (num * (n - i)) % mod
              den = (den * (i + 1)) % mod
          return (num * pow(den,
                            mod - 2, mod)) % mod
  
  
      def isthere(s,ind,c):
  
          for i in range(ind,len(s),ind+1):
  
              if s[i] != c:
                  #print('false at',i,s[i])
                  return False
  
          return True
  
      def solve(n,r1,r2):
  
  
          for i in range(n):
              if r1[i] == r2[i] == '1':
                  return 'NO'
  
          return 'YES'
  
  
  
  
      t = int(input())
      ans = []
      for _ in range(t):
          n = int(input())
  
          #n,m = map(int, input().split())
          r1 = list(input()[:-1])
          r2 = list(input()[:-1])
  
  
          # claims = []
          #
          # for i in range(m):
          #     claim = input().split()
          #
          #     claims.append([int(claim[0]),int(claim[1]),claim[2]])
  
          #a = [int(x) for x in input().split()]
          #b = [int(x) for x in input().split()]
          #arr = list(input())[:-1][::-1]
          ans.append(solve(n,r1,r2))
  
      p = 1
      for answer in ans:
          #print('Case #'+str(p)+": "+str(answer))
          print(answer)
          p += 1
  
  
  if __name__ == "__main__":
      import sys, threading
      import bisect
      import math
      import itertools
      from sys import stdout
  
  
      ############  Sorted Containers  ######################
      import heapq
      from queue import PriorityQueue
      from collections import deque
  
  
      ############ Tree Problems ( Use Python 3) ###########
      #sys.setrecursionlimit(2 ** 32 // 2 - 1)
      #threading.stack_size(1 << 27)
  
      input = sys.stdin.readline
      thread = threading.Thread(target=main)
      thread.start()
      thread.join()
  