You are given two positive integers l and r.

A positive integer is considered special if it has exactly $2$ proper divisors.

Return the count of numbers in the range $[$l, r$]$ that are not special.

Note: A proper divisor of a number is any positive divisor of that number other than the number itself.

Constraints:

• $1 \leq$ l $\leq$ r $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.