Modular Arithmetic · Challenge problem

For how many ordered pairs $(a, b)$ with $a, b \in \{0, 1, \ldots, 11\}$ does $ax \equiv b \pmod{12}$ have at least one solution $x$?