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.*;
  import java.math.*;
  public class Main{
      public static void main(String[] args) {
          try{
        Scan sc = new Scan();
        
        int tests = sc.scanInt();
        
        while(tests-->0){
            
            int k = sc.scanInt();
            boolean f = true;
            
           
            String s1 = sc.scanString();
            String s2 = sc.scanString();
          
            for(int i =0;i<k;i++){
                if(s1.charAt(i)=='1' && s2.charAt(i)=='1'){
                    f=false;
                      
                    break;
                }
            }
            
            if(!f){
                System.out.println("NO");
            }else{
                System.out.println("YES");
            }
            
        }
            
            
            
        
        
        }
          catch(Exception e){
             System.out.println(e.getMessage());
          }
      }
  }
  
  class Scan
  {
      private byte[] buf=new byte[1024];
      private int index;
      private InputStream in;
      private int total;
      public Scan()
      {
          in=System.in;
      }
      public int scan()throws IOException
      {
          if(total<0)
          throw new InputMismatchException();
          if(index>=total)
          {
              index=0;
              total=in.read(buf);
              if(total<=0)
              return -1;
          }
          return buf[index++];
      }
      public int scanInt()throws IOException
      {
          int integer=0;
          int n=scan();
          while(isWhiteSpace(n))
          n=scan();
          int neg=1;
          if(n=='-')
          {
              neg=-1;
              n=scan();
          }
          while(!isWhiteSpace(n))
          {
              if(n>='0'&&n<='9')
              {
                  integer*=10;
                  integer+=n-'0';
                  n=scan();
              }
              else throw new InputMismatchException();
          }
          return neg*integer;
      }
      public double scanDouble()throws IOException
      {
          double doub=0;
          int n=scan();
          while(isWhiteSpace(n))
          n=scan();
          int neg=1;
          if(n=='-')
          {
              neg=-1;
              n=scan();
          }
          while(!isWhiteSpace(n)&&n!='.')
          {
              if(n>='0'&&n<='9')
              {
                  doub*=10;
                  doub+=n-'0';
                  n=scan();
              }
              else throw new InputMismatchException();
          }
          if(n=='.')
          {
              n=scan();
              double temp=1;
              while(!isWhiteSpace(n))
              {
                  if(n>='0'&&n<='9')
                  {
                      temp/=10;
                      doub+=(n-'0')*temp;
                      n=scan();
                  }
                  else throw new InputMismatchException();
              }
          }
          return doub*neg;
      }
      public String scanString()throws IOException
      {
          StringBuilder sb=new StringBuilder();
          int n=scan();
          while(isWhiteSpace(n))
          n=scan();
          while(!isWhiteSpace(n))
          {
              sb.append((char)n);
              n=scan();
          }
          return sb.toString();
      }
      private boolean isWhiteSpace(int n)
      {
          if(n==' '||n=='\n'||n=='\r'||n=='\t'||n==-1)
          return true;
          return false;
      }
  }
  
  class Print
  {
      private final BufferedWriter bw;
      public Print()
      {
          this.bw=new BufferedWriter(new OutputStreamWriter(System.out));
      }
      public void print(Object object)throws IOException
      {
          bw.append(""+object);
      }
      public void println(Object object)throws IOException
      {
          print(object);
          bw.append("\n");
      }
      public void close()throws IOException
      {
          bw.close();
      }
  }
        
        
       
       