XOR Shift Function

You are given a function \( f(n) = n \oplus (n << 1) \), where \( \oplus \) denotes the bitwise XOR operator and \( << \) denotes the left shift operation.

For a given integer \( n \), your task is to compute \( f(n) \). You will be provided with multiple test cases. For each test case, output the result of \( f(n) \) on a separate line.

For example, if \( n = 1 \), then \( f(1) = 1 \oplus 2 = 3 \).

inputFormat

The input begins with an integer \( T \) representing the number of test cases. The next \( T \) lines each contain a single integer \( n \).

outputFormat

For each test case, output a single line containing the computed value of \( f(n) = n \oplus (n << 1) \).

## sample

5
1
2
10
0
1024

3
6
30
0
3072

</p>