The Chinese Remainder Theorem · Hard problem

Find the smallest positive integer $x$ with $x \equiv 1 \pmod{2}$, $x \equiv 0 \pmod{3}$ and $x \equiv 0 \pmod{5}$.