Minimum Sum

You are given a sequence of non-negative integers $A_1, A_2, \ldots, A_N$. At most once, you may choose a non-negative integer $X$ and for each valid $i$, change $A_i$ to $A_i \oplus X$ ($\oplus$ denotes bitwise XOR). Find the minimum possible value of the sum of all elements of the resulting sequence. ### Input - The first line of the input contains a single integer $T$ denoting the number of t