| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 39 | 21 | 13 | 52.000% |
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.
5 1 -4 0 -7 239
1 1 0 2 3