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.
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.
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 is the height of the tree.
2
3
42
3