Friendly Binary Strings

You are given two binary strings $A$ and $B$ of length $N$. You are allowed to perform the following operations any number of times (possibly zero): - Choose any index $i$ and swap the characters $A_i$ and $B_i$. - Choose any two indices $i$ and $j$ and simultaneously swap $A_i$ with $A_j$ and $B_i$ with $B_j$. Determine if it is possible to perform a sequence of these operations such that both $