This is the easy version of the problem. In this version, you are only asked to determine whether string (a) can be transformed into string (b). Yousef has given you two binary strings, (a) and (b), of the same length (n). You are allowed to perform any of the following operations: Choose a substring(^{\text{∗}}) in (a) equal to (001) and replace it with (100), or vice versa (i.e., (001 \rightarrow 100) or (100 \rightarrow \texttt {001})). Choose a substring in (a) equal to (110) and replace it with (011), or vice versa (i.e., (011 \rightarrow 110) or (110 \rightarrow \texttt {011})). Your task is to determine whether it is possible to transform string (a) into string (b) using a finite number of operations. (^{\text{∗}})A string (a) is a substring of a string (b) if (a) can be obtained from (b) by deletion of several (possibly zero or all) characters from the beginning and several (possibly zero or all) characters from the end. The first line contains a single integer (t) ((1 \le t \le 10^4)) — the number of test cases. The first line of each test case contains a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the length of each string. The second line of each test case contains a binary string (a) ((|a| = n)), consisting of only characters (0) and/or (1). The third line of each test case contains a binary string (b) ((|b| = n)), consisting of only characters (0) and/or (1). It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output " YES " if the string (a) can be transformed into string (b) using a finite number of operations, and " NO " otherwise. You can output the answer in any case (upper or lower). For example, th