Consider the following infinite full BST (Binary Search Tree) as shown in the figure.
You are required to find what is the minimum and maximum number in the subtree of the given node (including the node).

Input format

• The first line of input contains the number of test cases denoted by T.
• The first line of each test case contains 1 integer N denoting a node in the tree.

Output format

Print two integers containing minimum and maximum number in the subtree of the given node (including the node).

Constraints

$1 \leq T \leq 10$

$1 \leq N \leq 10^{10}$