Problem B: Tree height

Problem B: Tree height

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 570  Solved: 238
[Submit][Status][Web Board]

Description

        There is a complete binary tree. You will get the number of the nodes in this tree and find the height of the tree. The height of the leaf node is 1.


Input

In the first line, T are the number of the test (1<=T<=1e5).

In each case:

The first line have one integer N. N are the number of the nodes. (1<=N<=1e15).


Output

Output is the height of the tree.


Sample Input

2
3
4

Sample Output

2
3

HINT

[Submit][Status]