Math

You are given an array $a$ of $n$ distinct positive integers. Find the number of pairs $(i, j)$ with $1 \le i, j \le n$ for which the number $a\_i^2 + a\_j$ is a square of an integer.

The first line of the input contains a single integer $n$ ($1 \le n \le 10^6$), the size of the array.

The second line of the input contains $n$ distinct positive integers $a\_1, \ldots, a\_n$ ($1 \le a\_i \le 10^6$).

Output a single integer: the answer to the problem.

In the example, there are two such pairs, corresponding to $1^2 + 3 = 4 = 2^2$ and $2^2 + 5 = 9 = 3^2$.