The inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, …, an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:a1, a2, …, an-1, an (where m = 0 – the initial seqence)a2, a3, …, an, a1 (where m = 1)a3, a4, …, an, a1, a2 (where m = 2)…an, a1, a2, …, an-1 (where m = n-1)You are asked to write a program to find the minimum inversion number out of the above sequences.
，再怎么风光明媚的自家山川，
