Two element of an array $A$, $A[i]$ and $A[j]$ form an inversion if $A[i]>A[j]$ and $i<j$.

You will be given the array $A$, you have to find sum of count of inversions for all subarrays.

INPUT:
First line contains a single integer $N$, which denotes the size of the array.
Second line contains $N$ spaced integers denoting the elements of the array.

OUTPUT:
A single integer which is the desired answer $modulo\,10^9+7$.

CONSTRAINTS:
$1 \leq N \leq 10^5\\1 \leq A[i] \leq 10^{18}$