Divisor Pairs

You are given a sequence of $n$ integers $a_1, a_2, \ldots, a_n$. Count the ordered pairs $(i, j)$ with $i, j \in \{1, \ldots, n\}$, $i \neq j$, such that $a_i$ is a divisor of $a_j$.

The first line contains one integer $n$ ($1 \leq n \leq 2,000,000$).

The second line contains the $n$ integers $a_1, a_2, \ldots, a_n$ of the sequence ($1 \leq a_i \leq 2,000,000$).

Print one integer on the first line: the number of ordered pairs that satisfy the condition.

In the first sample there are 6 pairs with the required property: $(1, 2)$, $(1, 4)$, $(1, 5)$, $(4, 1)$, $(4, 2)$, $(4, 5)$.