The Chinese Remainder Theorem · Easy problem

Find the smallest positive integer $x$ with $x \equiv 0 \pmod 4$ and $x \equiv 1 \pmod 5$.