The Chinese Remainder Theorem · Superchallenge problem

How many integers $n$ with $1 \le n \le 2100$ have three different remainders when divided by $3$, $5$ and $7$?