23518번 - Divisible Inversions 다국어

Recently, Vasya learned how to calculate the number of inversions in a given permutation using Fenwick tree. However, Petya considers it an easy problem, so he decided to make a harder one. Petya asked Vasya to calculate the number of inversions such that the elements divide one another evenly. Formally, for the given permutation $(p_{1}, p_{2}, \ldots, p_{n})$, the task is to find the number of pairs of indices $(i, j)$ such that $i < j$ and $p_{i}$ is a multiple of $p_{j}$.

Help Vasya solve this problem.

The first line contains an integer $n$, the length of the permutation ($1 \le n \le 100\,000$). The second line contains $n$ space-separated integers $p_{i}$. It is guaranteed that the given integers form a permutation of integers from $1$ to $n$.

Print one integer: the number of divisible inversions in the given permutation.