AndOr

You are given a binary array $A$ of length $N$. Beauty of an array $A$ is defined as: $$ \biggl( \biggl( \biggl( \bigl( A_{1} \& A_{2} \bigr) | A_{3} \bigr) \& A_{4} \biggr) | \cdots \biggr) ^{\dagger} $$ You are given $Q$ queries of the form: - Given index $p$ and **binary** integer $X$, update $A_p$ to $X$ and print the beauty of the array $A$. **Note:** that each query changes array and afte