Permutation XOR Sum

For a permutation $P$ of integers from $1$ to $N$, let's define its value as $(1 \oplus P_1) + (2 \oplus P_2) + \ldots + (N \oplus P_N)$. Given $N$, find the maximum possible value of the permutation of integers from $1$ to $N$. As a reminder, $\oplus$ denotes the bitwise XOR operation ### Input The first line of the input contains a single integer $T$ $-$ the number of test cases. The descript