The congruence $x^2 \equiv a \pmod n$ is solvable if and only if $a$ is a quadratic residue modulo every prime factor of $n$. For $n = p \cdot q$, how many solutions exist if $a$ is a residue mod $p$ and mod $q$?