text.txt

北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the

Input

In the input, the first line contains an integer N, which represents the number of queries. In the next N lines, each contains a number representing a subtree with root number X (1 <= X <= 231 - 1). 
Output

There are N lines in total, the i-th of which contains the answer for the i-th query.
Sample Input

2
8
10

Sample Output

1 15
9 11