#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

void solve() {
  ll n;
  cin >> n;
  ll ok = 0, ng = n + 1;
  while (abs(ok - ng) > 1) {
    ll m = (ok + ng) / 2;
    (m <= n / m ? ok : ng) = m;
  }
  cout << ok << endl;
}

int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
}