How many integer pairs \((x, y)\) are there such that:
\[0 \leq x < 165, \quad 0 \leq y < 165 \text{ and } y^2 \equiv x^3 + x \pmod{165}?\]
Find the number of such integer pairs.

Let's think step by step and output the final answer within \boxed{}.
user