import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  /*
  debug {
    foreach (n; 1 .. 10 + 1) {
      int mn = int.max;
      int[][] pmss;
      auto ps = iota(n).array;
      do {
        int mx;
        foreach (i; 0 .. n - 1) {
          chmax(mx, min(ps[i], ps[i + 1]));
        }
        if (chmin(mn, mx)) {
          pmss = [];
        }
        if (mn == mx) {
          pmss ~= ps.dup;
        }
      } while (ps.nextPermutation);
      stderr.writeln(n, ": ", mn, " ", pmss.length);
      stderr.flush;
      // foreach (pms; pmss) {
        // writeln(pms);
      // }
      // stdout.flush;
    }
    return;
  }
  //*/
  
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt - 1;
      }
      
      const thr = (N - 2) / 2;
      int[] smalls, larges;
      foreach (i; 0 .. N) {
        if (A[i] <= thr) {
          smalls ~= i;
        } else {
          larges ~= i;
        }
      }
      
      long ans = long.max;
      if (N % 2 != 0) {
        int[] bs;
        foreach (j; 0 .. N / 2) {
          bs ~= larges[j];
          bs ~= smalls[j];
        }
        bs ~= larges[N / 2];
        long cost;
        foreach (i; 0 .. N) {
          cost += abs(bs[i] - i);
        }
        chmin(ans, cost);
      } else {
        int[] bs;
        foreach (j; 0 .. N / 2) {
          bs ~= larges[j];
          bs ~= smalls[j];
        }
        long cost;
        foreach (i; 0 .. N) {
          cost += abs(bs[i] - i);
        }
        chmin(ans, cost);
        foreach_reverse (j; 0 .. N / 2) {
          cost -= abs(bs[2 * j + 0] - (2 * j + 0));
          cost -= abs(bs[2 * j + 1] - (2 * j + 1));
          swap(bs[2 * j + 0], bs[2 * j + 1]);
          cost += abs(bs[2 * j + 0] - (2 * j + 0));
          cost += abs(bs[2 * j + 1] - (2 * j + 1));
          chmin(ans, cost);
        }
      }
      
      assert(ans % 2 == 0);
      ans /= 2;
      writeln(thr + 1, " ", ans);
    }
  } catch (EOFException e) {
  }
}