#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll inv2=499122177;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1,-1,-1,1,1};
ll dy[]={1,0,-1,0,-1,1,-1,1};

//Binary Indexes Tree
template< typename T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

  T sum(int k) {
    T ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  void add(int k, T x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};


void solve(){
    ll n;cin>>n;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    ll ans1=0;
    {
        ll cnt1=0,cnt2=1;
        vector<ll>b(n);
        rep(i,n){
            if(a[i]>n/2){
                b[i]=cnt1;
                cnt1+=2;
            }else{
                b[i]=cnt2;
                cnt2+=2;
            }
        }
        BinaryIndexedTree<ll>bit(n);
        ll ans=0;
        rep(i,n){
            ll s=bit.sum(n-1);
            if(b[i])s-=bit.sum(b[i]);
            ans+=s;
            bit.add(b[i],1);
        }
        ans1=ans;
    }
    ll ans2=inf;
    if(n%2==0){
        ll cnt1=1,cnt2=0;
        vector<ll>b(n);
        rep(i,n){
            if(a[i]>n/2){
                b[i]=cnt1;
                cnt1+=2;
            }else{
                b[i]=cnt2;
                cnt2+=2;
            }
        }
        BinaryIndexedTree<ll>bit(n);
        ll ans=0;
        rep(i,n){
            ll s=bit.sum(n-1);
            if(b[i])s-=bit.sum(b[i]);
            ans+=s;
            bit.add(b[i],1);
        }
        ans2=ans;
    }
    cout<<n/2<<' '<<min(ans1,ans2)<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}