Time Limit: 1000 MS Memory Limit: 65536 K

## Description

On Baihacker's birthday party, Jacky007 find there are so many girls here, he
think Baihacker must have a fascination
for girls, so Jacky007 go to ask Baihacker.
J: how many girls be fascinated.
B: you guess?
J: 66?
B: aha!
J: 99?
B: more than 66
J: 77?
B: less than 99
J: 88?
B: 77...
As you see, Baihacker will answer the previous one of Jacky007's ask. How many
questions need to ask in the worst-case
scenario with the best strategy.(For the above conversation, don't count the
first and the last one, so the answer is 3.)
## Input

One integer T on the first line indicates the number of cases.
Then followed by T lines, each line have one number n, means the number of girls
be fascinated is between 1 and n(inclusive),
constraints:
n is in the range of [1, 1000000].
## Output

For each case, output the answer in one line.
## Sample Input

2
2
4
## Sample Output

2
3
## Author

Jacky007