# Where Do Lovers Go?

Limits 1s, 512 MB

Cherry isn't feeling well right now as she found a problem that she couldn't solve. So she started to listen to Where Do Lovers Go? and you, to make her happy, have to solve the problem for her.

You are given an integer $n$. You have to find an integer $k$ ($1 \le k \le 10^{18}$) such that the following conditions are satisfied:

• $k$ is a multiple of $n$
• $n \, \& \, k = 0$. Here, $\&$ is the bitwise AND operator.

## Input

The first line of the input contains a single integer $t$ ($1 \le t \le 10^5$) denoting the number of test cases. The description of $t$ test cases follows.

The first and only line of each test case contains an integer $n$ ($1 \le n \le 10^8$).

## Output

For each test case, print a single line containing an integer $k$ ($1 \le k \le 10^{18}$) satisfying the aforementioned conditions.

If there are multiple solutions, output any. It can be shown that an answer always exists under the given constraints.

## Sample

InputOutput
3
5
34
69

10
340
4002