write a go solution for Description:
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 > 0 x\ \texttt{xor}\ y > 0

Where textttand is the bitwise AND operation, and textttxor is the bitwise XOR operation.

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

Input Format:
The first line of input contains a single integer t (1<=t<=10^3) — the number of input test cases.

For each test case, the only line of input contains one integer x (1<=x<=2^30).

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

Note:
Test case 1:

1;textttand;3=1>0, 1;textttxor;3=2>0.

Test case 2:

2;textttand;3=2>0, 2;textttxor;3=1>0.. Output only the code with no comments, explanation, or additional text.