from heapq import heapify, heappop, heappush
import sys

int1 = lambda x: int(x) - 1

# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]

INF = float("inf")
mod = int(1e9 + 7)
# mod = 998244353

n = ii()
a = li()

b = [i for i in range(n) if a[i] <= n // 2]
b.sort()
c = [2 * i + 1 for i in range(n // 2)]
ans = sum([abs(x - y) for x, y in zip(b, c)])
if ~n & 1:
    c = [2 * i for i in range(n // 2)]
    ans = min(ans, sum([abs(x - y) for x, y in zip(b, c)]))
print(n // 2, ans)