1 #include <iostream>
 2 #include <queue>
 3 #include <string>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <cstdio>
 7 #include <map>
 8 #include <vector>
 9 using namespace std;
10 int a[5000], b[5000][5000], n;
11 int main(){
12     cin >> n;
13     for (int i = 0; i < n; i++){
14         cin >> a[i];
15     }
16     for (int i = 0; i < n; i++){
17         for (int j = 0; j < n; j++){
18             b[i][j] = -1;
19         }
20     }
21     for (int i = 0; i < n; i++){
22         b[i][0] = 0;
23         for (int j = 0; j < i; j++){
24             if (a[i] < a[j]){
25                 b[i][j + 1] = b[i][j] + 1;
26             }else{
27                 b[i][j + 1] = b[i][j];
28             }
29         }
30         for(int j = i + 1;j < n;j++){
31             if(a[i] < a[j]){
32                 b[i][j] = b[i][j - 1] + 1;
33             }else{
34                 b[i][j] = b[i][j - 1];
35             }
36         }
37     }
38     int ans = 0;
39     map<int,int> m;
40     for (int i = 0; i < n; i++){
41         for (int j = i + 1; j < n; j++){
42             int x = 2 * (b[i][j] - b[i][i] + b[j][i] - b[j][j]) - (a[i] < a[j]?1:0) + (a[i] > a[j]?1:0);
43             m[x]++;
44             ans = min(ans,x);
45         }
46     }
47     int counter = 0;
48     for (int i = 1; i < n; i++){
49         int j = i;
50         while (j > 0 && a[j] < a[j - 1])
51         {
52             swap(a[j], a[j - 1]); // swap elements a[j] and a[j - 1]
53             counter++;
54             j = j - 1;
55         }
56     }
57     cout << counter + ans << " " << m[ans] << endl;
58     return 0;
59 }