Orders and Primitive Roots · Superchallenge problem

How many integers $n$ with $2 \le n \le 100$ have a primitive root (an integer $g$ whose order modulo $n$ equals $\varphi(n)$)?