Xor X,Get MAX

**This is an interactive problem.** There’s a hidden array $A$ consisting of $N$ **distinct non-negative** integers. You are allowed to interact with the judge using queries. Each query is of the form: - $X$ $Y$: Given two non-negative integers $X$ and $Y$ $(1 \leq X \leq N,0 \leq Y <2^{30})$ as the query, the hidden array $A$ is updated by setting $A_{X}:=A_{X} \oplus Y$, where $\oplus$ denotes