F. Hello World!
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given an array $$$a$$$ of length $$$n$$$. Find the number of ordered pairs $$$(x,y,z)$$$ such that $$$a_x\times a_y = a_z$$$ .

Input

The first line contains an integer $$$n$$$ $$$(1\le n\le100)$$$- the number of elements in the array.

The second line contains $$$n$$$ integers $$$a_1,a_2,\dots,a_n$$$ $$$(1\le a_i\le 10^4)$$$ - elements of the array $$$a$$$.

Output

Print a single integer - the number of ordered pairs that satisfied the constraints.

Example
Input
9
1 1 2 2 3 3 4 4 5
Output
68