The Chinese Remainder Theorem · Challenge problem

Does the system $x \equiv 2 \pmod 6$, $x \equiv 5 \pmod 9$ have a solution? If so, give the smallest positive one; if not, answer $0$.