Advanced Number Theory · Challenge problem

Let $N$ be the number of integers $n$ with $1 \le n \le 1000$ for which $n^2 + 1$ is divisible by $65$ (equivalently, $n^2 \equiv -1 \pmod{65}$). Find $N$.