시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB156392926.126%

문제

bobo loves geometric progressions! So he wants to know the number of geometric progressions of length $3$ in a sequence $a_1, a_2, \dots, a_n$.

That is to say, count the number of $(i, j, k)$ where $i < j < k$ and $a_{i} \cdot a_{k} = a_j^2$.

입력

The first line contains an integer $n$ ($1 \leq n \leq 1000000$).

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \leq a_1 < a_2 < \dots < a_n \leq 1000000$).

출력

A single integer denotes the number of geometric progressions.

예제 입력 1

3
1 2 4

예제 출력 1

1

예제 입력 2

4
1 2 4 8

예제 출력 2

2