Count many primes quickly with short code

The first line contains the number of test cases $T$. ($T \geq 1$)

Each test case is given on its own line as a single positive integer $N$.

At least one of the following holds.

• $T = 1$, $N \leq 10^{12}$
• $T \leq 100$, $N \leq 10^9$
• $T \leq 10^4$, $N \leq 10^6$

For each test case, print on its own line the number of primes less than or equal to $N$.