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 $k$ and jump to the left or to the right by the distance $2^k$.

Find the minimum number of turns the grasshopper has to make to move from the point with coordinate $0$ to the point with coordinate $x$.

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

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

For each test case, output a single integer: the minimum number of turns the grasshopper has to make.