One Down

You are given two binary strings $S$ and $T$, each of length $N$. You wish to convert $S$ into $T$ using the following operation any number of times (possibly zero): - Choose two distinct indices $i$ and $j$ ($1 ≤ i, j ≤ N$, $i ≠ j$) such that both $S_i = 1$ and $S_j = 1$, and change both to $S_i = 0$ and $S_j = 0$. Determine whether it is possible to transform $S$ into $T$ by applying the above