#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll T;
ll N;
ll answer;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> T;
    while (T--) {
        cin >> N;
        answer = 0LL;
        for (ll a=1LL; (a*a*a)<=N; a++) {
            if (a*(a*a+1) <= N) {
                answer += 1;
            }
            answer += 2*max((N/a-1)/a-a, 0LL);
            answer += max(N/(a*a+1)-a, 0LL);
            for (ll b=a+1; a*b*b<=N; b++) {
                if (a * (b * b + 1) <= N) answer += 1;
        if (b * (a * b + 1) <= N) answer += 2;
        answer += 2 * max((N / a - 1) / b - b, 0LL);
        answer += 2 * max((N / b - 1) / a - b, 0LL);
        answer += 2 * max(N / (a * b + 1) - b, 0LL);
            }
        }
    }

    return 0;
}