The Chinese Remainder Theorem · Hard problem

Find the smallest positive integer $x$ with $x \equiv 2 \pmod 4$, $x \equiv 4 \pmod 6$ and $x \equiv 1 \pmod 9$.