Proof Writing & Problem Solving · Superchallenge problem

A proof uses the step "if $a^2 \equiv b^2 \pmod n$, then $a \equiv b$ or $a \equiv -b \pmod n$." For how many positive integers $n \le 50$ is this step true for all integers $a$ and $b$?