The Great XOR#4142

The Great XOR

1 second
122.174 megabytes
Very easy

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

where is the bitwise XOR operator.

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

Input

The first line contains the number of queries q~(1 \le q \le 10^5). Each of the subsequent lines contains a long integer describing the value of x~(1 \le x \le 10^{10}) for a query.

Output

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

Examples

Example 1

Loading
Loading