XOR split
Bit manipulation
Basic programming
Basics of bit manipulation
25.0% success
5,993 attempts
2s time
256MB memory
1024KB max code
You are given a number \(N\). Your task is to find if there exist two distinct natural numbers such that their bitwise \(XOR\) is \(N\) and bitwise \(AND\) is \(0\). If such numbers exist, then print \(1\). Otherwise, print \(0\).
Input format
- The first line contains \(T\) denoting the number of test cases.
- The first line of each test case contains an integer \(N\).
Output format
For each test case, print the answer.
Constraints
\(1 \leq T \leq 10^6\)
\(0 \leq N \leq 10^{18}\)
Examples
Input
2 0 5
Output
0 1
Explanation
For the first testcase we can't find two numbers.
For the next testcase possible numbers are \(4\) and \(1\).
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Loading Editor...