Sort it

You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.

The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 1000); the next line contains a permutation of the n integers from 1 to n.

For each case, output the minimum times need to sort it in ascending order on a single line.

3
1 2 3
4 
4 3 2 1 

0
6

WhereIsHeroFrom

ZJFC 2009-3 Programming Contest