The Chinese Remainder Theorem · Superchallenge problem

For how many integers $a$ with $0 \le a < 100$ does the system $x \equiv a \pmod{12}$, $x \equiv a^2 \pmod{18}$ have a solution?