Advanced Number Theory · Challenge problem

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