Given an array A on size N, you need to find the number of ordered pairs $(i, j)$ such that $i < j$ and $A[i] > A[j]$.

Input:
First line contains one integer, N, size of array.
Second line contains N space separated integers denoting the elements of the array A.

Output:
Print the number of ordered pairs $(i, j)$ such that $i < j$ and $A[i] > A[j]$.

Constraints:
$1 \le N \le 10^6$
$1 \le A[i] \le 10^6$