#include <bits/stdc++.h>

using namespace std;


// n <= 10^6
// how many x*y <= n with x<y<z
int solveZ(int n, int z) {


}

int solve(int N) {
  int z;
  int ans = 0;
  for(z = 1; z * z <= N; z++) {
    ans += solveZ(N / z, z);
    ans += solveZ((N / (N / z)), N / z);
  }
  return ans;
}

const int N = (int) 1e6+10;

int f[N];

int main() {
  int T, n;

  for(int a = 1; a <= N; a++) {
    for(int b = a+1; a*b<=N; b++) {
      for(int c = b+1; 1LL*a*b*c<= N; c++) {
	f[a*b*c] ++;
      }
    }
  }

  for(int i = 1; i < N; i++) {
    f[i] += f[i-1];
  }

  scanf("%d", &T);
  for(int i = 0; i < T; i++) {
    scanf("%d", &n);
    printf("%d\n", f[n]);
  }
}