Advanced Number Theory · Challenge problem

Find the number of integers $n$ with $1 \le n \le 1500$ such that $n \equiv 4 \pmod{9}$ and $\gcd(n, 10) = 1$.