Existence, Uniqueness and Counterexamples · Superchallenge problem

For how many $n$ in $\{1, 2, \ldots, 30\}$ is "$a^2 \equiv b^2 \pmod n \iff a \equiv \pm b \pmod n$" true for ALL integers $a, b$?