#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>

using namespace std;

int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long ok = 2e9;
    long long ng = 0;
    while (ok - ng > 1) {
      long long m = (ok + ng) / 2;
      if (m * m > n) {
        ok = m;
      } else {
        ng = m;
      }
    }
    cout << ok - 1 << endl;
  }
  return 0;
}