Hard Number Theory · Superchallenge problem

For how many primes $p < 100$, other than $p = 2$ and $p = 7$, does the congruence $x^2 \equiv 7 \pmod p$ have an integer solution?