#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double ld;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
#define PB push_back()
#define ff first
#define ss second
#define MP maik_pair
#define FOR(p,a,b) for(ll p = (a); p < (ll)(b); ++p)
#define F(a) FOR(i, 0, a)
#define FF(a) FOR(j, 0, a)
#define FFF(a) FOR(k, 0, a)
#define EPS (1e-10)
#define EQ(a,b) (fabs(a-b) <= fabs(a-b)*EPS)
#define DEB(x) cerr << " >>> " << #x << " : " << x << "\n"

ll pole [1000001];

int main()
{
    ios::sync_with_stdio(false);
    ll sum = 0;
    FOR(i,1,100)
    {        
        FOR(j,i+1,1000)
        {
            if(i *j > 1000000)
            break;
            FOR(k,j+1,500000)
            {
                sum = i * j * k;
                if(sum > 1000000)
                break;
                pole[sum]++;         
            }
        }
    }
    FOR(i, 1, 1000001)
    {
        pole[i]+=pole[i-1];
    }
    
    ll testcase = 0;
    ll vstup = 0;
    cin >> testcase;
    F(testcase)
    {
    cin >> vstup;
    cout << pole[vstup] << endl;   
    
    }

}