Is saying $n \not\equiv \pm a$ mod $p$ equivalent to saying $n^2 \not \equiv a^2$ mod $p$?

I'm not really familiar with quadratic congruences. I'm pretty sure the RHS has more solutions modulo $p$, can anyone explain why? (assume $n$ is unknown, $a$ and $p$ are given, and $p$ is prime).