#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; --i)

ll solve(const vi &r) {
    int n = r.size();
    ll ret = 0;
    int k = 0;
    rep(i, n) {
        if ((~k & 1) ^ r[i]) {
            ret += i - k;
            k++;
            if (k <= i) k++;
        }
    }
    return ret;
}
int main() {
    int n;
    cin >> n;
    vi a(n);
    rep(i, n) cin >> a[i];

    int x = n / 2;
    rep(i, n) a[i] = (a[i] > x ? 0 : 1);
    ll y = solve(a);
    reverse(a.begin(), a.end());
    y = min(y, solve(a));
    printf("%d %lld\n", x, y);
    return 0;
}