/*
 * 1e6*sqrt(1e6) => slow??
 */
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1000006)
vi D[MX];
int S[MX],I,a;
int main(void){
    FT(1,MX){
        while(I*I<=k)++I;
        FOR(i,1,I)if(!(k%i)){
            D[k].PB(i);
            if(k/i!=i)D[k].PB(k/i);
        }
        sort(D[k].begin(),D[k].end());
        for(auto&h:D[k])for(auto&w:D[k/h]){
            if(w>=h)break;
            S[k]+=k/h/w<w;
        }
    }
    FT(1,MX)S[k]+=S[k-1];
    IN(_)F(_)scanf("%d",&a),printf("%d\n",S[a]);
    return 0;
}