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.


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


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


7 Output: 8 0
8 3
8 3

hide comments
ajeetk_973: 2017-04-09 14:49:56

my 100th ... easy one

piyushmittal: 2017-02-07 17:03:59

After five wrong submissions finally i got AC in it.....
Strictly advice not to use log function in this question it give me 5 wrong answer.

madhavgaba: 2017-01-27 16:04:31

Use fast i/o in java to get rid of tle

sachinsharma12: 2017-01-21 06:00:31

No need to think
Just code
Ac in one go))...

Ray Brish Bhanu: 2016-04-21 09:45:39

long long everywhere and no optimization required

dwij28: 2016-03-22 08:49:03

Easy one.. Hint: Think of the rightmost and leftmost set bits in the number. ;)

kushalanand: 2016-02-02 22:53:48

math functions in c++ and AC .

minhthai: 2016-01-26 10:52:20

java, runs in log(n) and still tle :(

GAURAV CHANDEL: 2016-01-13 10:40:09

Seems like Binary search is there to help you always...

THESEUS: 2015-08-24 17:49:58

Unfair for JAVA, getting TLE's, used bits, bufferedReader,printWriter

Added by:Tmbao
Time limit:0.100s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64