Given n integers, compute the sum of x_a * x_b over all pairs with a < b.
You are given nnn integers x1,x2,…,xnx_1, x_2, \dots, x_nx1,x2,…,xn. For every way of choosing two indices with a<ba < ba<b, add up xaxbx_a x_bxaxb.
∑1≤a<b≤nxaxb\sum_{1 \le a < b \le n} x_a x_b∑1≤a<b≤nxaxb
The first line contains the integer nnn. The integers x1,x2,…,xnx_1, x_2, \dots, x_nx1,x2,…,xn follow, separated by spaces or line breaks.
1≤n≤1000001 \le n \le 1000001≤n≤100000, ∣xi∣≤100|x_i| \le 100∣xi∣≤100
Print the sum of the products over all pairs on one line. The absolute value of the answer is at most 5×10135 \times 10^{13}5×1013.