#include <bits/stdc++.h>

using namespace std;

#define int long long
#define lep(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,b,a) for(int i = (b); i >= (a); i--)
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;

void submit(int ans) {
    cout << ans << "\n";
}

int get_sqrt(int x) {
    int res = sqrt(x);
    // cout << "x: " << x << ", res: " << res << "\n";
    while (res * res < x) res++;
    while (res * res > x) res--;
    // return 0;
    return res;
}

__int128 F(__int128 b, __int128 x) {
    __int128 res = b * b - 2LL * x * x * b + x * x * x * x + x;
    return res;
}

int bf(int xx) {
    int ans = 0;
    for (int a = 1; a <= xx; ++a) {
        for (int b = 1; b <= xx; ++b) {
            for (int x = 1; x <= xx; ++x) {
                for (int y = 1; y <= xx; ++y) {
                    if (x + y * y == a && y + x * x == b) ans++;
                }
            }
        }
    }
    return ans;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    // t = 0;
    // for (int i = 1; i <= 100; ++i) {
    //     cout << bf(i) << endl;
    // }
    while (t--) {
        int n;
        cin >> n;
        if (n == 1) {
            cout << 0 << endl;
            continue;
        }
        // int max_cand = 512LL * (int)pow(n,.25);
        // int mx = min(n, max((50LL), max_cand));
        // int ans = 0;
        // cout << "mx: " << mx << "\n";
        // lep(x,1,mx) {
        //     // 1 <= f(b) = b^2 - 2x^2b + x^4 + x <= N, and b > x^2
        //     // minimum is at b = 2x^2 / 2 = x^2
        //     int minb = x * x + 1; // it's also the minimizer of f(b)
        //     // maxb = (2x^2 + sqrt(4x^4 - 4(x^4 + x - N))) / 2 = x^2 + sqrt(4N-4x) / 2
        //     int maxb = x * x + get_sqrt(4 * n - 4 * x) / 2;
        //     // cout << "x: " << x << ", minb: " << minb << ", maxb: " << maxb << "\n";
        //     maxb = min(maxb, n);
        //     // // cout << "x: " << x << ", minb: " << minb << ", maxb: " << maxb << "\n";
        //     __int128 fmin = F(minb, x);
        //     __int128 fmax = F(maxb, x);
        //     // cout << "fmin: " << fmin << ", fmax: " << fmax << "\n";
        //     if (minb > n or fmin > n or minb > maxb) continue;
        //     ans += (maxb - minb + 1);
        // }
        // cout << ans << endl;
        // if (bf(n) != ans) 
        //     cerr << "Input: " << n << endl << "Correct: " << bf(n) << "\nIncorrect: " << ans << "\n";
        int l = 0, r = 1e9 + 1;
        while (r - l > 1) {
            int m = l + (r - l) / 2;
            if (m * m + m <= n) l = m;
            else r = m;
        }
        if (n >= l * l + l && n <= l * l + 2 * l + 1) cout << l * l << endl;
        else cout << l * l + 2 * (n - (l * l + 2 * l + 1)) << endl;
    }
}