Increase to Zero

Given an array of $N$ non-negative integers $A_1, A_2, \ldots, A_N$. In one operation, you can increase **any one** of the elements by $1$. Find the **minimum** number of operations needed to make the XOR of all elements ($A_1 \oplus A_2 \oplus \ldots \oplus A_N$) equal to $0$. Here $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). ### Input The