P11212 『STA - R8』Challenge Goldbach's Conjecture

There are $q$ queries. Each time, you are given a positive integer $n$. Ask how many positive integers $i$ with $i \le n$ satisfy that both $i$ and $n\bmod i$ are prime numbers.

The first line contains one positive integer $q$. The next $q$ lines each contain one positive integer $n$.

Output $q$ lines. Each line answers one query.

**This problem uses bundled tests.** Constraints: - Subtask 1 (30 pts): $q = 1$. - Subtask 2 (70 pts): no special constraints. For all testdata, $1 \le n,q \le 2\times10^5$. Luogu code length limit: 50 KB. Translated by ChatGPT 5