#include <algorithm>
#include <cmath>
#include <queue>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int get_result(int n) {
    vector <int> a = { 1 };

    int multip = sqrt(n);
    if (multip < sqrt(n)) {
        multip++;
    }

    int mul2 = n / multip;
    if (n % multip != 0) {
        mul2++;
    }

    return multip + mul2 - 2;

}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;
        cout << get_result(n) << endl;
    }

    return 0;
}