The Chinese Remainder Theorem · Hard problem

Find the smallest nonnegative integer $x$ satisfying $x \equiv 4 \pmod{5},\quad x \equiv 5 \pmod{7}$.