Max Swap And

You are given two arrays, $A$ and $B$, each containing $N$ integers. You are allowed to perform the following operation as many times as you like (possibly, zero): - Choose an index $i$ ($1 \leq i \leq N$), and swap $A_i$ and $B_i$. Find the maximum possible value that the expression $$ \left(A_1 \& A_2 \& \ldots \& A_N \right) + \left(B_1 \& B_2 \& \ldots \& B_N \right) $$ can take after perfor