#include using namespace std; using ll = long long; using V = vector; using VV = vector; using VVV = vector; using VS = vector; using P = pair; using M = map; using Q = queue; using PQ = priority_queue; using PQG = priority_queue>; using S = set; const ll MOD = 1000000007; const ll Mod = 998244353; const ll INF = 1LL << 60; #define rep(i,n) for(ll i = 0; i < n; i++) #define rep2(i,s,n) for(ll i = s; i < n; i++) #define rep3(i,s,n) for(ll i = s; i <= n; i++) #define all(x) (x).begin(),(x).end() #define MP(a,b) make_pair(a,b) #define fi first #define se second #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front templatebool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;} templatebool chmax(T&a, const T&b){if(avoid Vcin(vector&a){rep(i,(int)a.size())cin>>a[i];} templatevoid Vout(const vector&a){rep(i,(int)a.size())cout<0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;} const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0}; int main() { int t; cin >> t; rep(i,t) { ll n; cin >> n; ll ac = 0, wa = MOD; while(wa-ac>1) { ll mid = (ac+wa)/2; if(mid*mid <= n) ac = mid; else wa = mid; } cout << ac << endl; } }