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.*;

public class file {
    static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
    }

    static int digitsCount(long n) {
        return (int) Math.floor((long) Math.log10((long) n)) + 1;
    }

    static int gcd(int a, int b) {
        if (b == 0)
            return a;
        else
            return gcd(b, a % b);
    }

    static boolean isperfSquare(int n) {
        if (n < 1)
            return false;
        if (n == 1)
            return true;
        for (int i = 1; i <= n / 2; i++) {
            if (i * i == n)
                return true;
        }
        return false;
    }

    static boolean isPowerOfTwo(int n) {
        return (n > 0) && ((n & (n - 1))) == 0;
    }

    static boolean isPrime(long n) {
        if (n <= 1)
            return false;
        for (int i = 2; i <= Math.sqrt(n); i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    static ArrayList<Integer> SieveOfEratosthenes(int a) {
        boolean[] prime = new boolean[a + 1];
        ArrayList<Integer> v = new ArrayList<>();
        for (int i = 2; i <= a; i++)
            prime[i] = true;
        for (int i = 2; i * i <= a; i++) {
            if (prime[i]) {
                for (int j = i * i; j <= a; j += i)
                    prime[j] = false;
            }
        }
        for (int i = 2; i <= a; i++) {
            if (prime[i])
                v.add(i);
        }
        return v;
    }

    static boolean checkIfAP(int[] arr) {
        if (arr.length <= 2)
            return true;
        int diff = arr[1] - arr[0];
        for (int i = 1; i < arr.length - 1; i++) {
            if (arr[i + 1] - arr[i] != diff)
                return false;
        }
        return true;
    }

    static void inputArray(int[] arr, Scanner scan, int n) {
        for (int i = 0; i < n; i++) {
            arr[i] = scan.nextInt();
        }
    }

    static boolean linearIn(int[] outer, int[] inner) {
        return Arrays.asList(outer).containsAll(Arrays.asList(inner));
    }

    static String dectobin(int n) {
        if (n == 0)
            return "0";
        StringBuilder s = new StringBuilder();
        while (n != 0) {
            int x = n % 2;
            s.append(x);
            n /= 2;
        }
        s.reverse();
        return s.toString();
    }

    static Map<Integer, Integer> elemCount(int[] arr) {
        Map<Integer, Integer> mp = new HashMap<Integer, Integer>();
        for (int i = 0; i < arr.length; i++) {
            if (mp.containsKey(arr[i]))
                mp.put(arr[i], mp.get(arr[i]) + 1);
            else
                mp.put(arr[i], 1);
        }
        return mp;
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int T = scan.nextInt();
        while (T-- > 0) {
            int s = scan.nextInt();
            if (isperfSquare(s))
                System.out.println((int) (Math.sqrt(s)));
            else
                System.out.println((int) (Math.sqrt(s)) + 1);
        }
        scan.close();
    }
}