Given an array of size $N$, find the inversion count in the array. Two array elements $arr[i]$ and $arr[j]$ form an inversion if $arr[i] > arr[j]$ and $i < j$.
The first line contains an integer $N$, represents the size of the array.
The following one line contains $N$ integers, represent the elements in the array.
Output the number of inversions. You should not output a new line ('\n') after your answer.