eolymp
Competitions

XOR Contest

The Great XOR

Given a long integer x, count the number of values of a satisfying the following conditions:

  • a xor x > x

  • 0 < a < x

where a and x are long integers and xor is the bitwise XOR operator.

You are given q queries, and each query is in the form of a long integer denoting x. For each query, print the total number of values of a satisfying the conditions above on a new line.

Input

The first line contains the number of queries q (1q105). Each of the q subsequent lines contains a long integer describing the value of x (1x1010) for a query.

Output

For each query, print the number of values of a satisfying the given conditions on a new line.

Time limit 1 second
Memory limit 122.17 MiB
Input example #1
2
2
10
Output example #1
1
5