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.*;
  
  /**
   * -----------------|___________|---------------------
   * CCCCCCCCC   OOOOOOOOOO   DDDDDDDD      EEEEEEEEE
   * CCCC        OOO    OOO   DD    DDD     EEEE
   * CCCC        OOO    OOO   DD     DDD    EEEEEEEEEE
   * CCCC        OOO    OOO   DD     DDDD   EEEE
   * CCCCCCCCC   OOOOOOOOOO   DDDDDDDDDDDD  EEEEEEEEEE
   * -----------------|___________|---------------------
   */
  
  public class Main {
      private static final int MOD = 1000000007;
  
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          PrintWriter sout = new PrintWriter(outputStream);
  
          int t = in.nextInt();
          lab:
          while (t-->0) {
              int n = in.nextInt();
              char[][] array = new char[2][n];
              for (int i = 0; i < 2; i++) {
                  String str = in.nextToken();
                  array[i] = str.toCharArray();
              }
              for (int i = 0; i < n; i++) {
                  if (array[0][i] == '1' && array[1][i] == '1') {
                      sout.println("NO");
                      continue lab;
                  }
              }
              sout.println("YES");
          }
          sout.close();
      }
  
      public static int binarySearch(long[] array, long value) {
          int left = 0, right = array.length - 1;
          while (left <= right) {
              int m = (left + right) / 2;
              if (array[m] == value)
                  return m;
              else if (array[m] < value)
                  left = m + 1;
              else
                  right = m - 1;
          }
          return -1;
      }
  
      public static int gcd(int a, int b) {
          if (b == 0) {
              return a;
          }
          return gcd(b, a % b);
      }
  
      public static void sort(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < a.length; i++)
              a[i] = l.get(i);
      }
  
      private static int upperBound(int[] a, int low, int high, int element) {
          while (low < high) {
              int middle = low + (high - low) / 2;
              if (a[middle] > element)
                  high = middle;
              else
                  low = middle + 1;
          }
          return low;
      }
  
      public static class InputReader {
          private BufferedReader reader;
          private StringTokenizer tokenizer;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              tokenizer = null;
          }
  
          public String nextToken() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(nextToken());
          }
  
          public long nextLong() {
              return Long.parseLong(nextToken());
          }
  
          public double nextDouble() {
              return Double.parseDouble(nextToken());
          }
      }
  }
  