#include <iostream>
#include <cmath>

using namespace std;

//int solve(int N) {
//    int max = N/2;
//    int count = 0;
//    for(int i = 1; i < max; i++) {
//        for(int j = i+1; j < max; j++) {
//            if(i*j > N) break;
//            for(int k = j+1; k < N; k++) {
//                if(i*j*k <= N) count++;
//            }
//        }
//    }
//    return count;
//}

int solve(int N) {
    int count = 0;
    int max = ((int)cbrt(N))+1;
    int max2 = ((int)sqrt(N))+1;

    int rem1;
    int rem2;
    int rem3;
    for(int i = 1; i <= max; i++) {
        rem1 = N / i;
        //cout << "rem for i = " << i << " is " << rem << endl;
        if(rem1 != 0) {
            for(int j = i+1; j < max2; j++) {
                rem2 = rem1 / j;
                //cout << "rem for j = " << j << " is " << rem << endl;
                if(rem2 != 0) {
                    for(int k = j+1; k < N; k++) {
                        rem3 = rem2 / k;
                        //cout << "rem for k = " << k << " is " << rem << endl;
                        if(rem3 > 0) {
                         count++;
                         //cout << "counted!" << endl;
                         } else break;
                    }
                } else break;
            }
        } else break;
    }
    return count;
}

int main()
{
    int T;
    int N;

    cin >> T;

    for(int t = 0; t < T; t++) {
        cin >> N;
        cout << solve(N) << endl;
    }

    return 0;
}