Olympiad Number Theory · Superchallenge problem

How many primes $p \le 100$ satisfy: $-1$ is a quadratic residue modulo $p$? (Include $p = 2$, for which $-1 \equiv 1$ is a square.)