P14664 XOR Problem

Given $T$ queries, each with a non-negative integer $n$. Find two integers $a$ and $b$ that satisfy the following conditions: - $0 \le a,b \le n$ - $a \oplus b=n$ $\oplus$ means [bitwise xor](https://simple.wikipedia.org/wiki/Bitwise_operation#XOR). Maximize $a+b$.

**Each test case contains multiple data sets.** You will only receive the score for a test case if you pass all its data sets. The first line contains an integer $T$. The next $T$ lines each contains an integer $n$.

$T$ lines, each contains an integer representing the maximum of $a+b$.

### Example explanation There are a total of $6$ queries. - For the fifth query, $a=0,b=n$ is a possible choice; - For the sixth query, $a=3,b=5$ is a possible choice. ### Data Volume and Conventions **This problem is divided into subtasks.** Your score in a subtask is the minimum score across all its test cases. **This problem uses subtask dependencies.** You will not receive the score for a subtask unless you achieve full points on all its dependent subtasks.  | Subtask | $T \le$ | $n \le$ | Score | Dependencies | |:-----:|:-----:|:-----:|:-----:|:-----:| | $1$ | $10$ | $2^4-1$ | $5$ | none | | $2$ | $200$ | $2^8-1$ | $10$ | $1$ | | $3$ | $10^5$ | $2^{16}-1$ | $20$ | $1,2$ | | $4$ | $200$ | $2^{31}-1$ | $30$ | $1,2$ | | $5$ | $10^6$ | $2^{31}-1$ | $35$ | $1,2,3,4$ | For all of the cases, $1 \le T \le 10^6,0 \le n \le 2^{31}-1$.