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.*;
  
  public class TT {
  
      static Uzi uzi;
      static int counter = 0;
      static long[] dp;
      static ArrayList<Integer> list;
      static long N = 1000000000 + 7;
  
  
      public static void main(String[] args) throws IOException {
          FastReader fk = new FastReader();
  //        Scanner fk = new Scanner(System.in);
          PrintWriter pr = new PrintWriter(System.out);
  //        FileWriter wr = new FileWriter("large_fib_output.txt");
  
          int t = fk.nextInt();
  
          while(t-- > 0){
              int n = fk.nextInt();
              String[] arr = new String[n];
  
              for(int i =0; i<2; i++){
                  arr[i] = fk.next();
              }
  
              System.out.println(fxn(arr, n)? "YES" : "NO");
  
          }
  
          pr.close();
  
      }
  
      private static boolean fxn(String[] arr, int n){
          for(int i =1; i<n; i++){
              if(arr[0].charAt(i) == '1' && arr[1].charAt(i) == '1')
                  return false;
          }
  
          return true;
      }
  
  }
  
  class Uzi {
      boolean[] primes;
      int N;
      long[] fact;
  
      public Uzi() {
      }
  
      public Uzi(int n) {
          this.N = n;
          this.primes = new boolean[N + 1];
          this.fact = new long[N + 1];
      }
  
      public int fast_exponentiation(int n, int b, int mod) {
          // Time complexity: O(logn), Space complexity: O(1)
          int res = 1;
          while (b > 0) {
              res = (res * (b % 2 == 1 ? n : 1)) % mod;
              n = (n * n) % mod;
              b >>= 1;
          }
          return res;
  
      }
  
      public void fact() {
          fact[0] = 1;
  
          for (int i = 1; i <= N; i++) {
              fact[i] = i * fact[i - 1];
          }
      }
  
      public long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
      public void seive() {
          Arrays.fill(primes, true);
          primes[0] = primes[1] = false;
  
          for (int i = 2; i * i <= N; i++) {
              if (primes[i]) {
                  for (int j = i * i; j <= N; j += i)
                      primes[j] = false;
              }
          }
      }
  
      public int countDivisors(long num) {
          int counter = 0;
  
          for (int i = 1; i*i <= num ; i++) {
              if (num % i == 0)
                  counter += (i * i == num) ? 1 : 2;
          }
          return counter;
      }
  
      public boolean binary_search(int[] arr, long key) {
          int s = 0, e = arr.length - 1, curr;
  
          while (s <= e) {
              curr = (s + e) / 2;
              if (arr[curr] == key)
                  return true;
              else {
                  if (arr[curr] > key)
                      e = curr - 1;
                  else
                      s = curr + 1;
              }
          }
  
          return false;
      }
  
      private int elementJustGreater(int[] arr, int k) {
          // to find the first arr[i] >= k using binary search
  
          int s = 0, e = arr.length - 1, curr;
          int ans = -1;
  
          while (s <= e) {
              curr = (s + e) / 2;
              if (arr[curr] >= k) {
                  ans = arr[curr];
                  e = curr - 1;
              } else
                  s = curr + 1;
          }
  
          return ans;
      }
  
      public int[] elementJustSmaller(int[] arr, long k) {
          // to find the first arr[i] <= k using binary search
          int s = 0, e = arr.length - 1, curr;
          int[] ans = {-1, 0};
  
          while (s <= e) {
              curr = (s + e) / 2;
              if (arr[curr] <= k) {               // should be less than or equal to
                  //ans = arr[curr];
                  if (arr[curr] == k)
                      ans = new int[]{curr, 0};
                  else
                      ans = new int[]{curr, 1};
                  s = curr + 1;
              } else
                  e = curr - 1;
          }
          return ans;
      }
  }
  
  class FastReader {
      BufferedReader br;
      StringTokenizer st;
  
      public FastReader() {
          br = new BufferedReader(
                  new InputStreamReader(System.in));
      }
  
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
  
      int nextInt() {
          return Integer.parseInt(next());
      }
  
      long nextLong() {
          return Long.parseLong(next());
      }
  
      double nextDouble() {
          return Double.parseDouble(next());
      }
  
      String nextLine() {
          String str = "";
          try {
              str = br.readLine();
          } catch (IOException e) {
              e.printStackTrace();
          }
          return str;
      }
  }
  
  
  
  