import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;

public class Solution
{
    static int arr[]= {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,
    67, 71, 73, 79, 83, 89, 97,101, 103, 107, 109,} ;
    static long res = 1;
    static int i = 0;
    static int primeCount(long n)
    {
            if(res * arr[i] <= n)
            {
                res *= arr[i];
                ++i;
                primeCount(n);
            }
            return i;
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException
    {
        int q = scanner.nextInt();
        for (int qItr = 0; qItr < q; qItr++)
        {
            long n = scanner.nextLong();
            int result = primeCount(n);
            System.out.println(result);
        }
    }
}