#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

template <typename T>
struct bit{
    int n;
    vector<T> data;

    bit(int n_){
        n = 1;
        while(n < n_) n *= 2;
        data = vector<T>(n+1);
        for(int i = 0; i <= n; i++) data[i] = 0;
    }
    
    T sum(int i){
        T ret = 0;
        while(i > 0){
            ret += data[i];
            i -= i&-i;
        }
        return ret;
    }

    void add(int i, T x){
        while(i <= n){
            data[i] += x;
            i += i&-i;
        }
    }
};

ll count_inversion(vector<int> v){
    int n = v.size();
    bit<ll> bt(n);
    ll ans = 0;
    for(int x: v){
        ans += bt.sum(n)-bt.sum(x);
        bt.add(x, 1);
    }
    return ans;
}

const ll inf = 1e18;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n+1), pos(n+1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        pos[a[i]] = i;
    }
    ll ans = inf;
    if(n%2 == 0){
        vector<int> odd, even;
        for(int x = 1; x <= n/2; x++) odd.push_back(pos[x]);
        for(int x = n/2+1; x <= n; x++) even.push_back(pos[x]);
        sort(even.begin(), even.end());
        sort(odd.begin(), odd.end());
        vector<int> v;
        for(int i = 0; i < n/2; i++) {
            v.push_back(even[i]);
            v.push_back(odd[i]);
        }
        ans = count_inversion(v);
        ll tmp = ans;
        for(int i = n-2; i >= 0; i-=2){
            // i, i+1を反転
            if(v[i] < v[i+1]){
                tmp++;
            }else{
                tmp--;
            }
            chmin(ans, tmp);
        }
    }else{
        vector<int> odd, even;
        for(int x = 1; x <= n/2; x++) odd.push_back(pos[x]);
        for(int x = n/2+1; x <= n; x++) even.push_back(pos[x]);
        sort(even.begin(), even.end());
        sort(odd.begin(), odd.end());
        vector<int> v;
        for(int i = 0; i < n/2; i++) {
            v.push_back(even[i]);
            v.push_back(odd[i]);
        }
        v.push_back(even[n/2]);
        chmin(ans, count_inversion(v));
    }
    cout << n/2 << ' ' << ans << endl;
}