#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}


int main(){
  ll n;cin >> n;
  vl a(n);rep(i,n)cin >> a[i],a[i]--;
  ll mid=(n)/2;cout << mid <<" ";mid--;
  if(n&1){
    ll ans=0;
    ll now=1;
    rep(i,n){
      if(a[i]<=mid){
        ans+=abs(now-i);
        now+=2;
      }
    }
    cout << ans << endl;
  }
  else{
    vl left(n/2+1);
    ll now=1;
    ll pls=1;
    rep(i,n){
      if(a[i]<=mid){
        left[now]=left[now-1]+abs(i-pls);
        pls+=2;now++;
      }
    }
    vl right(n/2+1);
    now=1;pls=n-2;
    per(i,n){
      if(a[i]<=mid){
        right[now]=right[now-1]+abs(i-pls);
        pls-=2;now++;
      }
    }
    ll ans=INF;
    rep(i,n/2+1){
      chmin(ans,left[i]+right[n/2-i]);
    }
    //rep(i,n/2+1)cout << left[i] <<" ";cout << endl;
    //rep(i,n/2+1)cout << right[i] <<" ";cout << endl;
    cout << ans << endl;
  }
}