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).
1
9
000000010
000000000
 1
9
000000010
000100000
 1
60
000000000000000000000000000000000000000000000000000000000010
000000000000000000000000000000000000000000000000000000000010

YES
 YES
 NO

import java.util.*;
import java.util.function.Function;
import java.util.stream.Collectors;
import java.io.*;
import java.math.*;

public class A_ComputerGame {
    static StringBuilder sb;
    static dsu dsu;
    static long fact[];
    static int mod = (int) (1e9 + 7);

    static boolean solve() {
        int n=i();
        int t=i();
        int b=i();
        for(int i=0;i<n;i++){
            if(t%10==1 && b%10==1){
                return false;
            }
            t/=10;b/=10;
        }
        return true;
    }

    public static void main(String[] args) {
        sb = new StringBuilder();
        int test = 1;
        test = i();
        while (test-- > 0) {
            boolean ans=solve();
            if(ans)
                sb.append("YES\n");
            else sb.append("NO\n");
        }
        System.out.println(sb);

    }

    /*
     * fact=new long[(int)1e6+10]; fact[0]=fact[1]=1; for(int i=2;i<fact.length;i++)
     * { fact[i]=((long)(i%mod)1L(long)(fact[i-1]%mod))%mod; }
     */
//**************NCR%P******************	 
    static long ncr(int n, int r) {
        if (r > n)
            return (long) 0;

        long res = fact[n] % mod;
        // System.out.println(res);
        res = ((long) (res % mod) * (long) (p(fact[r], mod - 2) % mod)) % mod;
        res = ((long) (res % mod) * (long) (p(fact[n - r], mod - 2) % mod)) % mod;
        // System.out.println(res);
        return res;

    }

    static long p(long x, long y)// POWER FXN //
    {
        if (y == 0)
            return 1;

        long res = 1;
        while (y > 0) {
            if (y % 2 == 1) {
                res = (res * x) % mod;
                y--;
            }

            x = (x * x) % mod;
            y = y / 2;

        }
        return res;
    }

//**************END******************

    // *************Disjoint set
    // union*********//
    static class dsu {
        int parent[];

        dsu(int n) {
            parent = new int[n];
            for (int i = 0; i < n; i++)
                parent[i] = -1;
        }

        int find(int a) {
            if (parent[a] < 0)
                return a;
            else {
                int x = find(parent[a]);
                parent[a] = x;
                return x;
            }
        }

        void merge(int a, int b) {
            a = find(a);
            b = find(b);
            if (a == b)
                return;
            parent[b] = a;
        }
    }

//**************PRIME FACTORIZE **********************************//
    static TreeMap<Integer, Integer> prime(long n) {
        TreeMap<Integer, Integer> h = new TreeMap<>();
        long num = n;
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (n % i == 0) {
                int nt = 0;
                while (n % i == 0) {
                    n = n / i;
                    nt++;
                }
                h.put(i, nt);
            }
        }
        if (n != 1)
            h.put((int) n, 1);
        return h;

    }

//****CLASS PAIR ************************************************
    static class Pair implements Comparable<Pair> {
        int x;
        long y;

        Pair(int x, long y) {
            this.x = x;
            this.y = y;
        }

        public int compareTo(Pair o) {
            return (int) (this.y - o.y);

        }

    }
//****CLASS PAIR **************************************************

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int Int() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String String() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return String();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0)
                    writer.print(' ');
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

        public void flush() {
            writer.flush();
        }
    }

    static InputReader in = new InputReader(System.in);
    static OutputWriter out = new OutputWriter(System.out);

    public static long[] sort(long[] a2) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : a2)
            l.add(i);
        Collections.sort(l);
        for (int i = 0; i < l.size(); i++)
            a2[i] = l.get(i);
        return a2;
    }

    public static long pow(long x, long y) {
        long res = 1;
        while (y > 0) {
            if (y % 2 != 0) {
                res = (res * x);// % modulus;
                y--;

            }
            x = (x * x);// % modulus;
            y = y / 2;
        }
        return res;
    }

//GCD___+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
    public static long gcd(long x, long y) {
        if (x == 0)
            return y;
        else
            return gcd(y % x, x);
    }
    // ******LOWEST COMMON MULTIPLE
    // *********************************************

    public static long lcm(long x, long y) {
        return (x * (y / gcd(x, y)));
    }

//INPUT PATTERN********************************************************
    public static int i() {
        return in.Int();
    }

    public static long l() {
        String s = in.String();
        return Long.parseLong(s);
    }

    public static String s() {
        return in.String();
    }

    public static int[] readArray(int n) {
        int A[] = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = i();
        }
        return A;
    }

    public static long[] readArray(long n) {
        long A[] = new long[(int) n];
        for (int i = 0; i < n; i++) {
            A[i] = l();
        }
        return A;
    }

}