Bitwise Blend

Chef loves bitwise operations. So, he creates the following problem but needs your help to solve it. Chef calls a sequence of integers $A_1, A_2, \ldots, A_N$ `tasty` if it satisfies the following condition: - $parity(A_i \& A_{i+1}) \neq parity(A_i | A_{i+1})$ for $1 \leq i \lt N$. Chef gives you a sequence $A_1, A_2, \ldots, A_N$. You may perform the following operation on the sequence any num