Let's call an array a consisting of n positive (greater than 0) integers beautiful if the following condition is held for every i from 1 to n: either a_i = 1, or at least one of the numbers a_i - 1 and a_i - 2 exists in the array as well.

For example: 

  * the array [5, 3, 1] is beautiful: for a_1, the number a_1 - 2 = 3 exists in the array; for a_2, the number a_2 - 2 = 1 exists in the array; for a_3, the condition a_3 = 1 holds; 
  * the array [1, 2, 2, 2, 2] is beautiful: for a_1, the condition a_1 = 1 holds; for every other number a_i, the number a_i - 1 = 1 exists in the array; 
  * the array [1, 4] is not beautiful: for a_2, neither a_2 - 2 = 2 nor a_2 - 1 = 3 exists in the array, and a_2 ≠ 1; 
  * the array [2] is not beautiful: for a_1, neither a_1 - 1 = 1 nor a_1 - 2 = 0 exists in the array, and a_1 ≠ 1; 
  * the array [2, 1, 3] is beautiful: for a_1, the number a_1 - 1 = 1 exists in the array; for a_2, the condition a_2 = 1 holds; for a_3, the number a_3 - 2 = 1 exists in the array. 



You are given a positive integer s. Find the minimum possible size of a beautiful array with the sum of elements equal to s.

Input

The first line contains one integer t (1 ≤ t ≤ 5000) — the number of test cases.

Then t lines follow, the i-th line contains one integer s (1 ≤ s ≤ 5000) for the i-th test case.

Output

Print t integers, the i-th integer should be the answer for the i-th testcase: the minimum possible size of a beautiful array with the sum of elements equal to s.

Example

Input


4
1
8
7
42


Output


1
3
3
7

Note

Consider the example test:

  1. in the first test case, the array [1] meets all conditions; 
  2. in the second test case, the array [3, 4, 1] meets all conditions; 
  3. in the third test case, the array [1, 2, 4] meets all conditions; 
  4. in the fourth test case, the array [1, 4, 6, 8, 10, 2, 11] meets all conditions. 

import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;

public class Main {
    static boolean prime[]=new boolean[10000001];
   static  ArrayList<Integer> al[]=new ArrayList[11000001];
 static void pn(Object o)
 {
     System.out.println(o);
 }
static void p(Object o)
 {
     System.out.print(o+" ");
 }
public static int add(long a[],long p[])
{
    
HashMap<Long,Integer> hm= new HashMap<Long,Integer>();
int min=Integer.MAX_VALUE;
long val=p[0]-a[0];

boolean found=false;
for(int i=1;i<3;i++)
{
   

if(p[i]-a[i]==val+1&&i==2)
{
    found=true;
}
if(p[i]-a[i]==val+1)
{
    val=p[i]-a[i];
   
}

    }

if(found)
    return 2;
for(int i=1;i<3;i++)
{
   

if(p[i]-a[i]==val-1&&i==2)
{
    found=true;
}
if(p[i]-a[i]==val-1)
{
    val=p[i]-a[i];
   
}

    }

if(found)
    return 2;

for(int i=0;i<3;i++)
{
    long temp=p[i]-a[i];
    if(p[i]!=a[i]){
    if(hm.containsKey(temp))
    {
        hm.put(temp, hm.get(temp)+1);
    }
    
    else
    {
        hm.put(temp, 1);
    }
    }
}


return hm.size();
}
public static int multiply(long a[],long p[])
{
HashMap<Long,Integer> hm= new HashMap<Long,Integer>();
int min=Integer.MAX_VALUE;
for(int i=0;i<3;i++)
{
    if(a[i]!=0){
    if(p[i]%a[i]==0)
    {
    long temp=p[i]/a[i];
    if(hm.containsKey(temp))
    {
        hm.put(temp, hm.get(temp)+1);
    }
        else
    {
        hm.put(temp, 1);
    }
    
    }
  
    }
}
int sum=0;
for(Map.Entry<Long,Integer> entry :hm.entrySet())
{
    sum+=entry.getValue();
}
if(sum==3)
    return hm.size();
else
    return 3;
}
 public static void main(String args[])throws java.lang.Exception
 {
 
 
   Scanner s = new Scanner(System.in);
       
       
           int t=s.nextInt();
           while(t-->0)
           {
               int n=s.nextInt();
               int ans=1;
               int fin=0;
               while(n>0){
                   fin++;
                   n=n-ans;
                   ans+=2;
               }
               pn(fin);
           }
           
        
           
 
 
 
}
}
