CF2254C1.Marenol (easy version)

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 $\texttt{001}$ and replace it with $\texttt{100}$, or vice versa (i.e., $\texttt{001} \rightarrow \texttt{100}$ or $\texttt{100} \rightarrow \texttt {001}$).
• Choose a substring in $a$ equal to $\texttt{110}$ and replace it with $\texttt{011}$, or vice versa (i.e., $\texttt{011} \rightarrow \texttt{110}$ or $\texttt{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.

这是该问题的简单版本。在此版本中，你只需判断字符串 $a$ 是否能被转换为字符串 $b$。

Yousef 给你两个长度均为 $n$ 的二进制字符串 $a$ 和 $b$。

你被允许执行以下任意操作：

• 在 $a$ 中选择一个等于 $\texttt{001}$ 的子串，并将其替换为 $\texttt{100}$，或反之（即 $\texttt{001} \rightarrow \texttt{100}$ 或 $\texttt{100} \rightarrow \texttt{001}$）。
• 在 $a$ 中选择一个等于 $\texttt{110}$ 的子串，并将其替换为 $\texttt{011}$，或反之（即 $\texttt{011} \rightarrow \texttt{110}$ 或 $\texttt{110} \rightarrow \texttt{011}$）。

你的任务是判断能否通过有限次操作将字符串 $a$ 转换为字符串 $b$。

$^{\text{∗}}$ 若字符串 $a$ 可通过从字符串 $b$ 的开头删除若干（可能为零个或全部）字符、并从结尾删除若干（可能为零个或全部）字符而得到，则称 $a$ 是 $b$ 的子串。

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 $\texttt{0}$ and/or $\texttt{1}$.

The third line of each test case contains a binary string $b$ ($|b| = n$), consisting of only characters $\texttt{0}$ and/or $\texttt{1}$.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \le n \le 2 \cdot 10^5$）—— 每个字符串的长度。

每个测试用例的第二行包含一个二进制字符串 $a$（$|a| = n$），仅由字符 $\texttt{0}$ 和/或 $\texttt{1}$ 组成。

每个测试用例的第三行包含一个二进制字符串 $b$（$|b| = n$），仅由字符 $\texttt{0}$ 和/或 $\texttt{1}$ 组成。

保证所有测试用例的 $n$ 之和不超过 $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, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

对于每个测试用例，如果字符串 $a$ 可以通过有限次操作转换为字符串 $b$，则输出 "YES"；否则输出 "NO"。

你可以以任意大小写形式输出答案（大写或小写均可）。例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均会被识别为肯定回答。

In the first test case, it already holds that $a = b$. Therefore, the answer is YES.

In the second test case, we cannot perform any operation. Since $a \neq b$, the answer is NO.

In the third test case, we can choose the substring $a[1, 3] = \texttt{001}$ and replace it with $\texttt{100}$, making $a = b$. Therefore, the answer is YES.

In the seventh test case, we can do the following in order:

• $\texttt{1}$${\color{blue}{\texttt{100}}}$$\texttt{00}$ $\rightarrow$ $\texttt{1}$${\color{blue}{\texttt{001}}}$$\texttt{00}$
• $\texttt{100}$${\color{blue}{\texttt{100}}}$ $\rightarrow$ $\texttt{100}$${\color{blue}{\texttt{001}}}$
• ${\color{blue}{\texttt{100}}}$$\texttt{001}$ $\rightarrow$ ${\color{blue}{\texttt{001}}}$$\texttt{001}$
• $\texttt{00}$${\color{blue}{\texttt{100}}}$$\texttt{1}$ $\rightarrow$ $\texttt{00}$${\color{blue}{\texttt{001}}}$$\texttt{1}$

Therefore, the answer is YES.

在第一个测试用例中，已有 $a = b$。因此，答案为 YES。

在第二个测试用例中，我们无法执行任何操作。由于 $a \neq b$，答案为 NO。

在第三个测试用例中，我们可以选择子串 $a[1, 3] = \texttt{001}$ 并将其替换为 $\texttt{100}$，从而使 $a = b$。因此，答案为 YES。

在第七个测试用例中，我们可以按以下顺序进行操作：

• $\texttt{1}$${\color{blue}{\texttt{100}}}$$\texttt{00}$ $\rightarrow$ $\texttt{1}$${\color{blue}{\texttt{001}}}$$\texttt{00}$
• $\texttt{100}$${\color{blue}{\texttt{100}}}$ $\rightarrow$ $\texttt{100}$${\color{blue}{\texttt{001}}}$
• ${\color{blue}{\texttt{100}}}$$\texttt{001}$ $\rightarrow$ ${\color{blue}{\texttt{001}}}$$\texttt{001}$
• $\texttt{00}$${\color{blue}{\texttt{100}}}$$\texttt{1}$ $\rightarrow$ $\texttt{00}$${\color{blue}{\texttt{001}}}$$\texttt{1}$

因此，答案为 YES。