Strong Array

You are given an array of $n$ elements. There are $q$ queries of the form $l$ $r$. #### Query definition: - We take all the numbers from $l$ to $r$ and find their $XOR$. We then delete the numbers from $l$ to $r$ and replace them with a single number, their $XOR$, represented by $a_k$. Written formally, $$[a_1,a_2,...,a_{l-1},a_l,...,a_r,a_{r+1},...,a_n] \rightarrow [a_1,a_2,...,a_{l-1},a_k,a_{r