The Chinese Remainder Theorem · Superchallenge problem

For how many integers $n$ with $1 \le n \le 1001$ are the remainders of $n$ on division by $7$, $11$ and $13$ in strictly increasing order, that is, $(n \bmod 7) < (n \bmod 11) < (n \bmod 13)$?