Find XOR

**This is an interactive problem.** There is a sequence of positive integers $A_1, A_2, \ldots, A_N$. You do not know this sequence, but your task is to find the value of $A_1 \oplus A_2 \oplus \ldots \oplus A_N$, where $\oplus$ denotes the bitwise XOR operation. You may ask up to $20$ questions. In each question, you should choose an integer $K$ ($1 \le K \le 2 \cdot 10^6$) and the interactor r