#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...) 
#endif

gp_hash_table<ll, ll> regular_table;
gp_hash_table<ll, null_type> hash_table;
ordered_set oset;

ll T;
ll N;
ll answer;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> T;
    while (T--) {
        cin >> N;
        answer = 0;
        for (ll i=1; (i*i*i)<=N; i++) {
            if (i*(i*i+1) <= N) {
                ++answer;
            }
            answer += 2*max((N/i-1)/i-i, 0LL);
            answer += max(N/(i*i+1)-i, 0LL);
            for (ll j=i+1; i*j*j<=N; j++) {
                if (i*(j+j+1) <= N) {
                    ++answer;
                }
                if (j*(i*j+1) <= N) {
                    answer += 2;
                }
                answer += 2*max((N/i-1)/j-j, 0LL);
                answer += 2*max((N/j-1)/i-j, 0LL);
                answer += 2*max(N/(i*j+1)-j, 0LL);
            }
        }
        cout << answer << '\n';
    }

    return 0;
}