#include <stdio.h>
#include <stdlib.h>

unsigned long long int gcd(unsigned long long int a, unsigned long long int b)
{

	while (b) {
		unsigned long long int t = b;

		b = a % b;
		a = t;
	}
	return a;
}

unsigned int max_unique_primes(unsigned long long int n)
{
	unsigned int count;
	unsigned long long int prod;
	unsigned long long int prim;

	if (n < 2)
		return 0;

	prod = 2;
	count = 1;
	for (prim = 3; prod * prim <= n; prim += 2) {
		if (gcd(prod, prim) == 1) {
			prod *= prim;
			count++;
		}
	}
	return count;
}

int main(void)
{
	unsigned int q;

	if (scanf("%u", &q) != 1)
		return EXIT_FAILURE;

	while (q--) {
		unsigned long long int n;

		if (scanf("%llu", &n) != 1)
			return EXIT_FAILURE;
		
		printf("%u\n", max_unique_primes(n));
	}
	return EXIT_SUCCESS;
}

#include <stdio.h>
#include <stdlib.h>
 
int pr[16] ={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; 


/* 	Function that returns the maximum number 
	of unique prime factors for any number 
    	in the inclusive range [1,n] */

int factors (unsigned long long int n) {
    unsigned long long int x = 1; 
    int i = 0;
    while ( x <= n  && i < 16 ) {
        x = x * pr[i];
        /* 	Some debug tests 
        	(can help you understand this function)
        int j;
        printf("%d: %d", i, pr[0]);
        for (j = 1; j <= i; ++j) {
        	printf(" * %d", pr[j]);
        }
        printf(" = %lld <? %lld\n", x, n); */
        ++i;
    } 
    return i - 1;
}

int main() {
    
    int t, i;
    /* 	Really important to use at 
    	least a usigned long long int variable, 
    	if not there will be overflow */
    unsigned long long int n;    
    scanf("%d", &t);
    for (i = 1; i <=t; ++i) {
        scanf("%lld", &n); 
        printf("%d\n", factors(n));
    }
    return 0;
}