#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0) ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T cube(T x) {
  return x * x * x;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const long double PI = acos(-1.0);
const long double eps = 1e-9;
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e16 + 5;
const long long mod = (long long)1e9 + 7;
int a[5005];
int f[5005][5005];
int main() {
  std::ios::sync_with_stdio(false);
  int n;
  while (cin >> n) {
    for (int i = 0; i < (n); ++i) cin >> a[i];
    int res = 0;
    for (int i = 0; i < (n); ++i)
      for (int j = (i + 1); j <= (n - 1); ++j)
        if (a[i] > a[j]) res++;
    int m = -inf;
    int k = 0;
    memset(f, 0, sizeof(f));
    for (int i = 0; i < (n); ++i) {
      f[i][i] = 0;
      for (int j = (i + 1); j <= (n - 1); ++j) {
        if (a[j] < a[i])
          f[i][j] = f[i][j - 1] + 1;
        else
          f[i][j] = f[i][j - 1] - 1;
      }
    }
    int c, A;
    for (int i = 0; i < (n); ++i) {
      c = 0;
      for (int j = (i - 1); j >= (0); --j) {
        if (a[j] > a[i])
          c++;
        else
          c--;
        A = f[j][i - 1] + c;
        if (A > m) {
          m = A;
          k = 1;
        } else if (A == m)
          k++;
      }
    }
    cout << (res - m) << " " << k << endl;
  }
}
