Given an integer $x$, find two non-negative integers $a$ and $b$ such that $(a \wedge b) + (a \vee b) = x$, where $\wedge$ is the bitwise AND operation and $\vee$ is the bitwise OR operation.
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first and only line of each test case contains a single integer $x$.
-----Output-----
If there is no valid pair $(a, b)$, print a single line containing the integer $-1$. Otherwise, print a single line containing two space-separated integers $a$ and $b$.
If there are multiple solutions, you may print any one of them.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le x \le 10^{18}$
-----Subtasks-----
Subtask #1 (30 points):
- $1 \le T \le 200$
- $1 \le x \le 200$
Subtask #2 (70 points): original constraints
-----Example Input-----
2
1
8
-----Example Output-----
0 1
5 3
# cook your dish here
n=int(input())
for _ in range(n):
 a=int(input())
 if(a%2==0):
  f=(a//2)-1
  s=a-f
 else:
  f=(a//2)
  s=a-f
 print(f,s)
# cook your dish here
n=int(input())
for _ in range(n):
 a=int(input())
 if(a%2==0):
  f=(a//2)-1
  s=a-f
 else:
  f=(a//2)
  s=a-f
 print(f,s)