#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<int> p;
  p.reserve(n / 2);
  REP(i, n) {
    if (a[i] <= n / 2) p.emplace_back(i);
  }
  cout << n / 2 << ' ';
  if (n % 2 == 1) {
    ll y = 0;
    REP(i, n / 2) y += abs(i * 2 + 1 - p[i]);
    cout << y << '\n';
  } else {
    ll dp[2]{0, LINF};
    REP(i, n / 2) {
      ll nxt[2]{dp[0] + abs(i * 2 + 1 - p[i]),
                min(dp[0], dp[1]) + abs(i * 2 - p[i])};
      swap(dp, nxt);
    }
    cout << min(dp[0], dp[1]) << '\n';
  }
  return 0;
}