VECTAR3 - Changus Small Battle

This is tutorial version of Changu's Big Battle!

Changu is going to fight a battle. He is powerful but he has a few limitations. If he kills x enemies on a particular day, then he can only kill x-1 or x or x+1 enemies on the next day. And also, he can kill no more than 1 enemy on the last day of battle. Given N, the number of enemies he has to kill to end the battle, you have to calculate the minimum number of days required for Changu to finish the battle, keeping in mind his limitations. He starts on day 1 by x=1, i.e. killing one enemy.

Input

The first line contains an integer T denoting the number of test cases.

Each of the next T lines contain an integer N.

Output

T lines: Minimum number of days required for each test case.

Constraints

1 <= N <= 10^9

1 <= T <= 1000

Example

Input:
3
4
1
9

Sample Output:
3
1
5

Explanation

Case 1: 1 + 2 + 1

Case 2: 1

Case 3: 1 + 2 + 3 + 2 + 1


Added by:Piyush Kumar
Date:2016-06-19
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: GOSU

hide comments
2016-06-19 12:57:00
wrong test case 3: he can do 3+3+2+1

Re: The problem statement was updated! 'He starts on day 1 by x=1, i.e. killing one enemy.'
Please read the description carefully!

Last edit: 2016-06-19 13:18:11
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.