Counting Is Fun

Consider two **binary** arrays $A$ and $B$, each of size $N$ and a permutation$^\dagger$ $P$ of length $N$. You will make two new arrays $C$ and $D$, each of size $N$, such that: - $C_i=A_{P_i}$ ($1 \leq i \leq N$) - $D_i=B_{P_i}$ ($1 \leq i \leq N$) Let us define: - The score of the permutation $P$ as $\min(\text{LNDS}(C),\text{LNDS}(D))$, where $\text{LNDS}(X)$ gives the length of **longes