CF1790E.Vlad and a Pair of Numbers

Vlad found two positive numbers $a$ and $b$ ($a,b \gt 0$). He discovered that $a \oplus b = \frac{a + b}{2}$, where $\oplus$ means the bitwise exclusive OR , and division is performed without rounding..

Since it is easier to remember one number than two, Vlad remembered only $a\oplus b$, let's denote this number as $x$. Help him find any suitable $a$ and $b$ or tell him that they do not exist.

弗拉德找到了两个正整数 $a$ 和 $b$（$a,b \gt 0$）。他发现 $a \oplus b = \frac{a + b}{2}$，其中 $\oplus$ 表示按位异或，且除法运算不进行四舍五入。

由于只记住一个数比记住两个数更容易，弗拉德仅记住了 $a\oplus b$，我们将其记为 $x$。请帮助他找出任意一组满足条件的 $a$ 和 $b$，或者告诉他这样的 $a$ 和 $b$ 不存在。

The first line of the input data contains the single integer $t$ ($1 \le t \le 10^4$) — the number of test cases in the test.

Each test case is described by a single integer $x$ ($1 \le x \le 2^{29}$) — the number that Vlad remembered.

输入数据的第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 表示测试用例的数量。

每个测试用例由一个整数 $x$（$1 \le x \le 2^{29}$）描述—— 即弗拉德所记住的数字。

Output $t$ lines, each of which is the answer to the corresponding test case. As the answer, output $a$ and $b$ ($0 \lt a,b \le 2^{32}$), such that $x = a \oplus b = \frac{a + b}{2}$. If there are several answers, output any of them. If there are no matching pairs, output -1.

输出 $t$ 行，每行对应一个测试用例的答案。作为答案，输出满足条件的 $a$ 和 $b$（$0 \lt a,b \le 2^{32}$），使得 $x = a \oplus b = \frac{a + b}{2}$。若存在多个答案，输出任意一个即可；若不存在满足条件的数对，则输出 -1。