Let A$[1...$ n$]$ be an array of n distinct numbers. If i $<$ j and A$[$i$]>$ A$[$j$],$ then the pair $($i$,$ j$)$ is called an inversion of A$.$

With an array of n elements, what is the possible maximum number of inversions?