#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <cmath>
#include <algorithm>
typedef long long int ll;
#define f first
#define s second
#define vi vector<int>
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define floop(count,a, n) for(int count{a}; count < n; ++count)
#define tr(c, it) for(auto it{c.begin()}; it != c.end(); ++it)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define newl '\n'



using namespace std;

const int MOD = 1e9+7;
const ld PI = acos(-1);
const ld EPS = 1e-9;
const ll INF = 1e18;

    
int main(){

    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
        #ifndef ONLINE_JUDGE       
        freopen("input.txt", "r", stdin);                                     
        freopen("output.txt", "w", stdout);                       
        #endif    
    int cas;cin>>cas;
        while(cas--){
            int n;
            cin>>n;
            int a = sqrt(n);
            if(a*a == n)
                cout<<a<<"\n";
            else
                cout<<a + 1<<"\n";


        }
    cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";

    return 0; 
}