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

public class Main {
    public static void main(String[] args) {
        FastReader in = new FastReader(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        long[] arr = new long[5001];
        arr[1] = 1;
        arr[2] = 2;
        arr[3] = 2;
        arr[4] = 2;

        int max = 9;
        int cnt = 3;
        for(int i = 5; i <= 5000; i++) {
            if(i > max) {
                max += cnt * 2 + 1;
                cnt++;
            }
            arr[i] = cnt;
        }

        int t = in.nextInt();

        while(t-- > 0) {
            int n = in.nextInt();

            pw.println(arr[n]);
        }

        pw.close();
    }

    static class FastReader {
        private final int BS = 1 << 16;
        private final char NC = (char) 0;
        private final byte[] buf = new byte[BS];
        private final BufferedInputStream in;
        private int bId = 0;
        private int size = 0;
        private char c = NC;
        private double cnt = 1;

        public FastReader(InputStream is) {
            in = new BufferedInputStream(is, BS);
        }

        private char getChar() {
            while(bId == size) {
                try {
                    size = in.read(buf);
                } catch(Exception e) {
                    return NC;
                }

                if(size == -1) {
                    return NC;
                }
                bId = 0;
            }

            return (char) buf[bId++];
        }

        public int nextInt() {
            return (int) nextLong();
        }

        public long nextLong() {
            cnt = 1;
            boolean neg = false;
            if(c == NC) c = getChar();
            for(; (c < '0' || c > '9'); c = getChar()) {
                if(c == '-') neg = true;
            }
            long res = 0;
            for(; c >= '0' && c <= '9'; c = getChar()) {
                res = (res << 3) + (res << 1) + c - '0';
                cnt *= 10;
            }
            return neg ? -res : res;
        }

        public double nextDouble() {
            double cur = nextLong();
            return c != '.' ? cur : cur + nextLong() / cnt;
        }

        public String next() {
            StringBuilder res = new StringBuilder();
            while(c <= 32) c = getChar();
            while(c > 32) {
                res.append(c);
                c = getChar();
            }
            return res.toString();
        }

        public String nextLine() {
            StringBuilder res = new StringBuilder();
            while(c <= 32) {
                c = getChar();
            }

            while(c != '\n') {
                res.append(c);
                c = getChar();
            }

            return res.toString();
        }

        public boolean hasNext() {
            if(c > 32) {
                return true;
            }

            while(true) {
                c = getChar();
                if(c == NC) {
                    return false;
                } else if(c > 32) {
                    return true;
                }
            }
        }
    }
}