The Chinese Remainder Theorem · Superchallenge problem

For how many three-digit integers $n$ (that is, $100 \le n \le 999$) are the three remainders of $n$ on division by $4$, by $5$ and by $6$ all different?