Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 2.0 Seconds Memory Limit: 65536K

Total Runs: 3163 Accepted Runs: 875

In this problem, you have to analyze a particular sorting algorithm.
The algorithm processes a sequence of *n* distinct integers by swapping
two adjacent sequence elements until the sequence is sorted in ascending order.
For the input sequence
### Sample Input

### Output for Sample Input

Ultra-QuickSort produces the output9 1 0 5 4,

Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.0 1 4 5 9.

The input contains several test cases. Every test case begins with a line
that contains a single integer *n < 500,000* -- the length of the input sequence.
Each of the the following *n* lines contains a single integer
*0 ≤ a[i] ≤ 999,999,999*, the *i*-th input sequence element. Input is terminated
by a sequence of length *n = 0*. This sequence must not be processed.

For every input sequence, your program prints a single line containing an
integer number *op*, the minimum number of swap operations necessary
to sort the given input sequence.

5 9 1 0 5 4 3 1 2 3 0

6 0

Maintance:G.D.Retop. Developer: SuperHacker, G.D.Retop