The problem is straight and simple.
Given a number X ,find how many positive A ( \(A\gt 0)\) exists, such that
1. A \(\newcommand*\xor{\mathbin{\oplus}}\) X =A + X
2. A \(\lt\) X
Input:
The first line of the input will contain T , the number of test-cases.
Next T lines will contain integer X .
Output:
For each test-case , output the answer in a separate line.

Constraints:

• \(1 \le T \le 10^5\)
• \(1 \le X \le 10^7\)

Note: \(\newcommand*\xor{\mathbin{\oplus}}\) is the bitwise Exclusive-OR operator( XOR ). and + is the usual addition symbol.