Hard Number Theory · Superchallenge problem

How many integers $a$ with $1 \le a \le 102$ are congruent modulo $103$ both to a perfect square and to a perfect cube? (That is, $a \equiv x^2$ and $a \equiv y^3 \pmod{103}$ for some integers $x, y$.)