#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000 * 1000 * 1000 + 7;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const long long MOD2 = 998244353;
const long long N = 1000 * 1000 + 10;
const long long N2 = 70;
const long double PI = 3.141592653589793;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long power(long long x, long long y, long long p = LLONG_MAX) {
  long long res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void solve() {}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long m = n;
    if (n == 1) {
      cout << 0 << "\n";
      continue;
    }
    long long i = 2, cnt = 1;
    while ((i * i) <= n) {
      long long ans =
          (cnt + ceil((long double)(n * 1.00) / (long double)(i * 1.00)));
      if (ans > m) {
        break;
      } else {
        m = ans;
      }
      cnt++;
      i++;
    }
    cout << m - 1 << "\n";
  }
  return 0;
}
