/*
Practice Karni hai !!!!!!
*/
#include <bits/stdc++.h>

#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL)
#define endl "\n"
#define llu unsigned long long int
#define ll long long int
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a * b / __gcd(a, b)
#define pb push_back
#define ins insert
#define fr first
#define sc second
#define all(x) x.begin(), x.end()
using namespace std;
#ifndef ONLINE_JUDGE
#define deb(x) cerr << #x << " "; __print(x); cerr << "\n";
#else
#define deb(x)
#endif
template <typename T> void sort    (vector<T>& v) {std::sort(v.begin(), v.end());}
template <typename T> void sortbig (vector<T>& v) {std::sort(v.begin(), v.end(), greater<T>());}
void __print(int x) {cerr << x << " ";}
void __print(ll x) {cerr << x << " ";}
void __print(llu x) {cerr << x << " ";}
void __print(char x) {cerr << x << " ";}
void __print(bool x) {cerr << x << " ";}
void __print(string x) {cerr << x << " ";}
template <class T1, class T2> void __print(vector<pair<T1, T2>> x) {cerr << "[ "; for (pair<T1, T2> z : x)cerr << "{" << z.fr << ", " << z.sc << "}" << " "; cerr << "]";}
template <class T> void __print(vector<T> x) {cerr << "[ "; for (T i : x) __print(i); cerr << "]";}
template <class T> void __print(set<T> x) {cerr << "[ "; for (T i : x) __print(i); cerr << "]";}
template <class T> void __print(map<T, T> x) {for (pair<T, T>  i : x) {cerr << i.fr << " " << i.sc << "\n";}}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
#ifndef ONLINE_JUDGE
    freopen("debug.txt", "w", stderr);
#endif
    fastio;
    int t = 1;
    cin >> t;
    while (t--)
    {
        ll n;
        cin >> n;
        ll x = 1;
        while (x * x < n)
            x++;
        cout << x << "\n";
    }
    return 0;
}
// 1 = dono
// 2 = pehela
// 3 = doosra
// 4 = koi nhi
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/