#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 3e5 + 5;

ll get_ans(ll n) {
    ll ans = 0;
    for (ll x = 1; x * x * x <= n; x++) {
        if (x * (x * x + 1) <= n) {
            ans++;
           // cout << "1 " << x << ' ' << x << ' ' << x << '\n';
        }

        if (x * x + 1 <= n) {
            ans += max<ll>(0, n / (x * x + 1) - x);
          /*  for (int i = x + 1; i <= n / (x * x + 1); i++) {
                cout << "2 " << i << ' ' << x << ' ' << x << '\n';
            }*/
        }
        for (ll y = x + 1; x * y + 1 <= n; y++) {
            ans += max<ll>(0, (n / (x * y + 1) - (x - 1))) * 2;
           /* for (int i = x + 1; i <= n / (x * y + 1); i++) {
                cout << "3 " << i << ' ' << x << ' ' << y << '\n';
                cout << "3 " << i << ' ' << y << ' ' << x << '\n';
            }*/
        }

        ll need = (n - x) / x;

        for (ll y = x + 1; y * y <= need; y++) {
            ans += max<ll>(0, need / y - y) * 2;
          /*  for (int i = y + 1; i <= need / y; i++) {
                cout << "4 " << x << ' ' << y << ' ' << i << '\n';
                cout << "4 " << x << ' ' << i << ' ' << y << '\n';
            }*/
            if (y * y <= need) {
                //cout << "5 " << x << ' ' << y << ' ' << y << '\n';
                ans++;
            }

        }
    }
    return ans;
}

void solve() {
    ll n;
    cin >> n;

    cout << get_ans(n) << '\n';
}

int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
#endif
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}