1 #include <cstdio>
 2 #include <algorithm>
 3 using namespace std;
 4 
 5 #define MAXN    5000
 6 
 7 int N;
 8 int A[MAXN], sorted[MAXN];
 9 
10 int bisrch(int v)
11 {
12     int l, r;
13     l = 0, r = N-1;
14     while(l<r) {
15         int m = (l+r) >> 1;
16         if (v > sorted[m]) l = m+1;
17         else if (v < sorted[m]) r = m-1;
18         else return m;
19     }
20     return l;
21 }
22 
23 int main(void)
24 {
25     while(scanf("%d", &N) > 0) {
26         for(int i=0; i<N; ++i) {
27             scanf("%d", &A[i]);
28             sorted[i] = A[i];
29         }
30         int invpairs = 0;
31         for(int i=0; i<N-1; ++i) {
32             int k = i;
33             for(int j=i+1; j<N; ++j) {
34                 invpairs += (A[j] < A[i]);
35                 if (sorted[j] < sorted[k]) k = j;
36             }
37             swap(sorted[i], sorted[k]);
38         }
39         int mininv = invpairs;
40         for(int i=0; i<N; ++i) {
41             int j = bisrch(A[i]);
42             invpairs += N-(j<<1) - 1;
43             if (mininv > invpairs) mininv = invpairs;
44         }
45         printf("%d\n", mininv);
46     }
47     return 0;
48 }