27186번 - Just like pickle 다국어

문제

Grasshopper is standing on a line at a point with coordinate 0ドル$. In one turn it can choose any non-negative integer number $k$ and jump to the left or to the right to the distance 2ドル^k$.

Help it to find out what is the minimum number of turns it has to do in order to move from the point with coordinate 0ドル$ to the point with coordinate $x$.

입력

The first line contains a single integer $t$ --- a number of test cases (1ドル \le t \le 100,000円$).

Each test case consists of a single line, that contains a single integer $x$ --- coordinate of a target point for the grasshopper ($-10^{18} \le x \le 10^{18}$).

출력

For each test case output a single integer --- the minimum number of turns that the grasshopper has to do.

제한

힌트