Misha's Product

Misha really loves inventing new operations. Recently he invented a new operation, which he named Misha's product after himself.

Misha's product of a set of distinct integers $a_1, a_2, \ldots, a_n$ is defined as follows. Consider all ordered pairs $(a_i, a_j)$ of distinct numbers from this set. For each pair, write the two numbers one after another with no space to get a new number $b_{ij}$. Misha's product of the initial set is the sum of all values $b_{ij}$.

Help Misha calculate Misha's product for the given set of integers. Misha wants to compute it modulo $10^9 + 7$.

The first line contains one integer $n$, the number of elements in the set ($2 \le n \le 10^5$).

The second line contains $n$ distinct integers $a_1, a_2, \ldots, a_n$, the numbers in the set ($1 \le a_i \le 10^8$).

Output one number: Misha's product of the given set of numbers, modulo $10^9 + 7$.

There are six possible pairs in the sample test, and the following values $b_{ij}$ are obtained: 13, 31, 101, 103, 110, 310. Their sum is 668.