AND OR Conversion 1

**This is the first version of the problem. Here, you only need to output whether the pair of strings is good.** A pair of strings $A$ and $B$, both of length $N$, are said to be good if $A$ can be converted to $B$ by using either of the following operations multiple times: - Choose an index $i$ ($1 \le i < N$), update $A_i$ and $A_{i + 1}$ both to $A_i | A_{i + 1}$. - Choose an index $i$ ($1 \l