Grid Path (Easy)

**This is the easy version of the problem and is worth the usual 100 points. Here, $Q = 0$, i.e. there are no updates to the grid.** You have a binary grid of size $2 \times N$. The $j$-th character of the $i$-th row is $A_{(i, j)}$. In one operation, you can choose a row $X$ and a column $Y$ ($1 \le Y < N$); and then swap $A_{(X, Y)}$ and $A_{(X, Y + 1)}$, i.e. you are allowed to make adjacent