Hamiltonian Wall
Sir Monocarp Hamilton is planning to paint his wall. The wall can be represented as a grid, consisting of $$$2$$$ rows and $$$m$$$ columns. Initially, the wall is completely white.Monocarp wants to paint a black picture on the wall. In particular, he wants cell $$$(i, j)$$$ (the $$$j$$$-th cell in the $$$i$$$-th row) to be colored black, if $$$c_{i, j} =$$$ 'B', and to be left white, if $$$c_{i, j} =$$$ 'W'. Additionally, he wants each column to have at least one black cell, so, for each $$$j$$$, the following constraint is satisfied: $$$c_{1, j}$$$, $$$c_{2, j}$$$ or both of them will be equal to 'B'.In order for the picture to turn out smooth, Monocarp wants to place down a paint brush in some cell $$$(x_1, y_1)$$$ and move it along the path $$$(x_1, y_1), (x_2, y_2), \dots, (x_k, y_k)$$$ so that:   for each $$$i$$$, $$$(x_i, y_i)$$$ and $$$(x_{i+1}, y_{i+1})$$$ share a common side;  all black cells appear in the path exactly once;  white cells don't appear in the path. Determine if Monocarp can paint the wall.
In the first testcase, Monocarp can follow a path $$$(2, 1)$$$, $$$(2, 2)$$$, $$$(1, 2)$$$, $$$(1, 3)$$$ with his brush. All black cells appear in the path exactly once, no white cells appear in the path.In the second testcase, Monocarp can follow a path $$$(1, 1)$$$, $$$(2, 1)$$$.In the third testcase:   the path $$$(1, 1)$$$, $$$(2, 1)$$$, $$$(2, 2)$$$, $$$(2, 3)$$$, $$$(1, 3)$$$, $$$(2, 4)$$$, $$$(2, 5)$$$, $$$(1, 5)$$$ doesn't suffice because a pair of cells $$$(1, 3)$$$ and $$$(2, 4)$$$ doesn't share a common side;  the path $$$(1, 1)$$$, $$$(2, 1)$$$, $$$(2, 2)$$$, $$$(2, 3)$$$, $$$(1, 3)$$$, $$$(2, 3)$$$, $$$(2, 4)$$$, $$$(2, 5)$$$, $$$(1, 5)$$$ doesn't suffice because cell $$$(2, 3)$$$ is visited twice;  the path $$$(1, 1)$$$, $$$(2, 1)$$$, $$$(2, 2)$$$, $$$(2, 3)$$$, $$$(2, 4)$$$, $$$(2, 5)$$$, $$$(1, 5)$$$ doesn't suffice because a black cell $$$(1, 3)$$$ doesn't appear in the path;  the path $$$(1, 1)$$$, $$$(2, 1)$$$, $$$(2, 2)$$$, $$$(2, 3)$$$, $$$(2, 4)$$$, $$$(2, 5)$$$, $$$(1, 5)$$$, $$$(1, 4)$$$, $$$(1, 3)$$$ doesn't suffice because a white cell $$$(1, 4)$$$ appears in the path. 
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of testcases.The first line of each testcase contains a single integer $$$m$$$ ($$$1 \le m \le 2 \cdot 10^5$$$) — the number of columns in the wall.The $$$i$$$-th of the next two lines contains a string $$$c_i$$$, consisting of $$$m$$$ characters, where each character is either 'B' or 'W'. $$$c_{i, j}$$$ is 'B', if the cell $$$(i, j)$$$ should be colored black, and 'W', if the cell $$$(i, j)$$$ should be left white.Additionally, for each $$$j$$$, the following constraint is satisfied: $$$c_{1, j}$$$, $$$c_{2, j}$$$ or both of them are equal to 'B'.The sum of $$$m$$$ over all testcases doesn't exceed $$$2 \cdot 10^5$$$.
For each testcase, print "YES" if Monocarp can paint a wall. Otherwise, print "NO".
import sys
input = sys.stdin.readline

def sol(n, a, b):
    wall = [a, b]
    ind = 0
    check = True
    for i in range(n):
        if wall[ind][i] != 'B':
            check = False
            break
        elif wall[ind ^ 1][i] == 'B':
            ind ^= 1
    if check:
        return 'YES'
    ind = 1
    check = True
    for i in range(n):
        if wall[ind][i] != 'B':
            check = False
            break
        elif wall[ind ^ 1][i] == 'B':
            ind ^= 1
    if check:
        return 'YES'
    else:
        return 'NO'
t = int(input())
for case in range(t):
    n = int(input())
    a = input()
    b = input()
    print(sol(n, a, b))
import sys
input = sys.stdin.readline

def print_poss(n, one, two):
    i = 0
    while i < n:
        if one[i] == 'W':
            cur = False
            break
        elif two[i] == 'W':
            cur = True
            break
        i += 1
    i = i + 1
    for i in range(i, n):
        if one[i] == 'W':
            if cur == True:
                print('NO')
                return
        elif two[i] == 'W':
            if cur == False:
                print('NO')
                return
        else:
            cur = not cur
    print('YES')
for t in range(int(input())):
    n = int(input())
    one = input().rstrip()
    two = input().rstrip()
    print_poss(n, one, two)
def solve():
    n = int(input())
    s1 = input()
    s2 = input()
    k1 = k2 = 1
    for i in range(n):
        if s1[i] == s2[i] == 'B':
            (k1, k2) = (k2, k1)
        elif s1[i] == 'B':
            k2 = 0
        else:
            k1 = 0
    if k1 or k2:
        return 'YES'
    return 'NO'
import sys
input = lambda : sys.stdin.readline().rstrip()
t = int(input())
for i in range(t):
    print(solve())