Max BIT Sum

Given two arrays $A$ and $B$ each of length $N$. Find the value $\sum_{i=1}^N\sum_{j=1}^N \max(A_i\oplus B_j,A_i\& B_j)$. Here $\oplus$ and $\&$ denote the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) and [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND) respectively. ### Input - The first line of input contains a single integer $T$