XOR with smallest element

Chef has an array $A$ of length $N$ and an integer $X$. In one operation, Chef does the following: - Find the smallest element in the current array. Let this be $S$. - Next, pick any **one** index $i$ such that $A_i = S$ - Finally, replace $A_i$ with $A_i \oplus X$ Here $\oplus$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation. For example, if $A = [1, 1,