#include using namespace std; using ll = long long; #define rep(i,m,n) for(int i=m; i> T; while(T--){ ll N; cin >> N; ll r = ll(1e9 + 10), l = 0LL; while(r != l + 1LL){ ll mid = (r + l)/2LL; if(mid * mid >= N) r = mid; else l = mid; } cout << (r*r == N ? r : l) << endl; } return 0; }