CF1688A.Cirno's Perfect Bitmasks Classroom

Even if it's a really easy question, she won't be able to answer it

— Perfect Memento in Strict Sense

Cirno's perfect bitmasks classroom has just started!

Cirno gave her students a positive integer $x$. As an assignment, her students need to find the minimum positive integer $y$, which satisfies the following two conditions:

x\\ \\texttt{and}\\ y \\gt 0$$ $$x\\ \\texttt{xor}\\ y \\gt 0

Where $\texttt{and}$ is the bitwise AND operation, and $\texttt{xor}$ is the bitwise XOR operation.

Among the students was Mystia, who was truly baffled by all these new operators. Please help her!

即使这是一道非常简单的题目，她也无法回答。

——《严格意义下的完美记忆》

琪露诺的完美位运算课堂刚刚开始！

琪露诺给了她的学生们一个正整数 $x$。作为课后作业，学生们需要找出满足以下两个条件的最小正整数 $y$：

x\ \texttt{and}\ y > 0$$ $$x\ \texttt{xor}\ y > 0

其中 $\texttt{and}$ 表示按位与运算，$\texttt{xor}$ 表示按位异或运算。

学生中有一位名叫 Mystia 的同学，面对这些全新的运算符完全不知所措。请帮帮她！

The first line of input contains a single integer $t$ ($1 \leq t \leq 10^3$) — the number of input test cases.

For each test case, the only line of input contains one integer $x$ ($1 \leq x \leq 2^{30}$).

输入的第一行包含一个整数 $t$（$1 \leq t \leq 10^3$）—— 表示输入测试用例的数量。

对于每个测试用例，输入的唯一一行包含一个整数 $x$（$1 \leq x \leq 2^{30}$）。

For each test case, print a single integer — the minimum number of $y$.

对于每个测试用例，输出一个整数——即 $y$ 的最小值。

Test case 1:

$1\; \texttt{and}\; 3=1 \gt 0$, $1\; \texttt{xor}\; 3=2 \gt 0$.

Test case 2:

$2\; \texttt{and}\; 3=2 \gt 0$, $2\; \texttt{xor}\; 3=1 \gt 0$.

测试用例 1：

$1\; \texttt{and}\; 3=1 \gt 0$, $1\; \texttt{xor}\; 3=2 \gt 0$。

测试用例 2：

$2\; \texttt{and}\; 3=2 \gt 0$, $2\; \texttt{xor}\; 3=1 \gt 0$。