John had a chocolate bar with the size of 2^i. At his birthday party, he shared this chocolate bar to his friend. But his friend just wanted to taste a piece of this chocolate bar which had the length of N (1 <= N <= 10^18) so that John had to break this chocolate bar into pieces to get the piece for his friend. Unfortunately, this chocolate bar was so breakable that John just can break it into half each time.

Help him find the smallest length of the chocolate bar that he needs and the minimum times of breaking the chocolate bar to get the piece for his friend.

Input

T - the number of test cases. In each of the next T lines, there is one numbers N

Output

For every test case, print one line the length of the chocolate bar and the minimum number of times to break the bar.

Example

Input:
3
8
5
7

Output:
8 0
8 3
8 3