#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n;
    cin >> n;
    vector<int> a(n), pos;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        if(a[i] <= n / 2)pos.push_back(i);
    }
    ll ans = 0;
    if(n & 1){
        for(int i = 0; i < pos.size(); i++){
            ans += abs(2 * i + 1 - pos[i]);
        }
    }else{
        ll s = 0;
        for(int i = 0; i < pos.size(); i++){
            s += abs(2 * i + 1 - pos[i]);
        }
        ans = s;
        for(int i = pos.size() - 1; i >= 0; i--){
            s -= abs(2 * i + 1 - pos[i]);
            s += abs(2 * i - pos[i]);
            ans = min(ans, s);
        }
    }
    cout << n / 2 << " " << ans << endl;
}