Given an integer n, return true if n has exactly $3$ positive divisors. Otherwise, return false.

An integer $d$ is a divisor of n if there exists an integer $k$ such that n $= k imes d$.

Constraints:

• $1 \leq$ n $\leq 10^4$

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.