#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int main() {
    
	int N;
	cin>>N;
	
	
	
	vector<int> a(N);
	vector pos(2,vector<int>());
	rep(i,N){
		cin>>a[i];
		if(a[i]<=N/2)pos[0].push_back(i);
		else pos[1].push_back(i);
	}
	
	long long ans = 1000000000000000000;
	vector<int> t;
	for(int j=0;j<N;j+=2)t.push_back(j);
	rep(i,2){
		if(pos[i].size()==t.size()){
			long long sum = 0;
			rep(j,t.size()){
				sum += abs(pos[i][j]-t[j]);
			}
			ans = min(ans,sum);
		}
	}
	if(N%2==0){
		rep(j,2){
			vector<int> x = pos[j],y = t;
			long long sum = 0;
			rep(i,x.size())sum += abs(x[i]-y[i]);
			ans = min(ans,sum);
			
			rep(i,t.size()){
				sum -= abs(x[i]-y[i]);
				y[i]++;
				sum += abs(x[i]-y[i]);
				//cout<<sum<<endl;
				ans = min(ans,sum);
			}
		}
		
	}
	cout<<N/2<<' ';
	cout<<ans<<endl;
    return 0;
}