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.util.*;
  	import java.io.*;
  	import java.math.BigInteger;
  		public class Main {
  			
  			static ArrayList<Integer> []adj;
  			static boolean visited[];
  			public static void main(String[] args) throws FileNotFoundException,IOException, InterruptedException {
  				Scanner s=new Scanner(System.in);
  				PrintWriter pw=new PrintWriter(System.out);
  				
  
  				
  				int t=s.nextInt();
  				while (t-->0)
  				{
  					int n=s.nextInt();
  					char []a=s.next().toCharArray();
  					char []b=s.next().toCharArray();
  					boolean flag=true;
  					for (int i=0; i<n;i++)
  					{
  						if (a[i]=='1' && b[i]=='1')flag=false;
  					}
  					if (flag)pw.println("YES");
  					else pw.println("NO");
  							
  					
  						
  							
  				}
  					
  					
  
  
  			
  				
  				
  				
  				
  				
  				
  				
  				
  				
  				
  				
  				
  				pw.flush();
  			}
  
  			//returns INDEX
  			public static Integer ceiling (int []arr, int x)
  			{
  				int lower=0,upper=arr.length-1;
  				Integer index=null;
  				while (lower<=upper)
  				{
  					int mid=(lower+upper)/2;
  					if (arr[mid]>=x)
  					{
  						upper=mid-1;
  						index=mid;
  					}
  					else
  						lower=mid+1;
  				}
  				return index;
  			}
  			public static Integer floor (int []arr,int x)
  			{
  				int lower=0,upper=arr.length-1;
  				Integer index=-1;
  				while (lower<=upper)
  				{
  					int mid=(lower+upper)/2;
  					if (arr[mid]<=x)
  					{
  						lower=mid+1;
  						index=mid;
  					}
  					else
  						upper=mid-1;
  				}
  				return index;
  			}
  	//		static void takeOrLeave( int i, String x){
  	//			
  	//	        if(i == n+1)
  	//	        {
  	//	        	System.out.println(x);
  	//	        	//list.add(x);
  	//				return;
  	//	        }
  	//	        
  	//	        String y=x;
  	//	        y+=i;
  	//	        takeOrLeave(i+1,x+i);
  	//	        takeOrLeave(i+1,x);
  	//	        
  	//	       
  	//	    }
  	//	static void takeOrLeave( int i, ArrayList<Integer> acc){
  	//				
  	//		        if(i == n+1)
  	//		        {
  	//		        	System.out.println(acc);
  	//		        	//list.add(acc);
  	//		        	return;
  	//		        }
  	//		        
  	//		      //  acc.add(i);
  	//		        ArrayList<Integer> temo=(ArrayList<Integer>) acc.clone();
  	//		        temo.add(i);
  	//		        takeOrLeave(i+1,temo);
  	//		        //acc.remove(i);
  	//		        takeOrLeave(i+1,acc);
  	//		        
  	//		       
  	//		    }
  		public static void permute(char []a , int l, int r)
  	    {
  	        if (l == r)
  	            System.out.println(Arrays.toString(a));
  	        else
  	        {
  	            for (int i = l; i <= r; i++)
  	            {
  	            	a= swap(a,l,i);
  	                permute(a, l+1, r);
  	                a = swap(a,l,i);
  	            }
  	        }
  	    }
  			public static  char[] swap(char []a, int l, int i) {
  				char temp=a[l];
  				a[l]=a[i];
  				a[i]=temp;
  				
  			return a;
  		}
  			public static double log2(long m)
  		    {
  		        double result = (double)(Math.log(m) / Math.log(2));
  		  
  		        return result;
  		    }
  	
  			public static void shuffle(int []a)
  			{	
  				for (int i=0; i<a.length;i++)
  				{
  					int randIndex=(int)(Math.random()*a.length);
  					int temp=a[i];
  					a[i]=a[randIndex];
  					a[randIndex]=temp;
  				}
  				
  			}
  			public static void shuffle(long []a)
  			{	
  				for (int i=0; i<a.length;i++)
  				{
  					int randIndex=(int)(Math.random()*a.length);
  					long temp=a[i];
  					a[i]=a[randIndex];
  					a[randIndex]=temp;
  				}
  				
  			}
  			
  			
  			
  			
  			
  			}
  	
  		 class Pair implements Comparable{
  			int x;
  			int y;
  			Pair(int x, int y)
  			{
  				this.x=x;
  				this.y=y;
  			}
  			@Override
  			public int compareTo(Object o) {
  				Pair p=(Pair)o;
  				return this.x-p.x;
  			}
  			public String toString()
  			{
  				return "("+x+","+y+")";
  			}
  			
  		}
  		 class Scanner 
  		{
  			StringTokenizer st;
  			BufferedReader br;
  	
  			public Scanner() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  	}		
  			public Scanner(String s) throws FileNotFoundException
  			{
  				br =new BufferedReader(new FileReader(s));
  			}
  	
  			public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
  	
  	
  			public String next() throws IOException 
  			{
  				while (st == null || !st.hasMoreTokens()) 
  					st = new StringTokenizer(br.readLine());
  				return st.nextToken();
  			}
  	
  			public int nextInt() throws IOException {return Integer.parseInt(next());}
  			
  			public long nextLong() throws IOException {return Long.parseLong(next());}
  	
  			public String nextLine() throws IOException {return br.readLine();}
  			
  			public double nextDouble() throws IOException
  			{
  				String x = next();
  				StringBuilder sb = new StringBuilder("0");
  				double res = 0, f = 1;
  				boolean dec = false, neg = false;
  				int start = 0;
  				if(x.charAt(0) == '-')
  				{
  					neg = true;
  					start++;
  				}
  				for(int i = start; i < x.length(); i++)
  					if(x.charAt(i) == '.')
  					{
  						res = Long.parseLong(sb.toString());
  						sb = new StringBuilder("0");
  						dec = true;
  					}
  					else
  					{
  						sb.append(x.charAt(i));
  						if(dec)
  							f *= 10;
  					}
  				res += Long.parseLong(sb.toString()) / f;
  				return res * (neg?-1:1);
  			}
  			 public long[] nextLongArr(int n) throws IOException {
  		            long[] arr = new long[n];
  		            for (int i = 0; i < n; i++)
  		                arr[i] = nextLong();
  		            return arr;
  		        }
  	
  		        public int[] nextIntArr(int n) throws IOException {
  		            int[] arr = new int[n];
  		            for (int i = 0; i < arr.length; i++)
  		                arr[i] = nextInt();
  		            return arr;
  		        }
  			
  			public boolean ready() throws IOException {return br.ready();}
  	
  	
  		}