Bubble Sort Minimum Swaps

You are given a list of n integers. Your task is to determine the minimum number of swaps required to sort the list in ascending order using the Bubble Sort algorithm.

The algorithm repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The process is repeated until the list is sorted. The total number of swaps performed during this process is the answer.

You can refer to the formula for the number of swaps in Bubble Sort using \(n\) items as a simulation process. Note that the algorithm stops when no more swaps are needed.

inputFormat

The input is given via standard input and consists of two lines.

• The first line contains a single integer \(n\) (\(1 \leq n \leq 10^5\)), representing the number of elements in the list.
• The second line contains \(n\) space-separated integers representing the list of card values.

outputFormat

Output a single integer to standard output, which is the minimum number of swaps required to sort the list using the Bubble Sort algorithm.

## sample

4
4 3 2 1

6

</p>