|Codeforces Round #674 (Div. 3)|
Initially, you have the array $$$a$$$ consisting of one element $$$1$$$ ($$$a = $$$).
In one move, you can do one of the following things:
For example, consider the sequence of five moves:
Your task is to find the minimum number of moves required to obtain the array with the sum at least $$$n$$$.
You have to answer $$$t$$$ independent test cases.
The first line of the input contains one integer $$$t$$$ ($$$1 \le t \le 1000$$$) — the number of test cases. Then $$$t$$$ test cases follow.
The only line of the test case contains one integer $$$n$$$ ($$$1 \le n \le 10^9$$$) — the lower bound on the sum of the array.
For each test case, print the answer: the minimum number of moves required to obtain the array with the sum at least $$$n$$$.
5 1 5 42 1337 1000000000
0 3 11 72 63244