import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

def cost(aa):
    s = t = 0
    cs = [0]
    for a in aa:
        if a <= n//2:
            s += 1
            cs.append(abs(s-t)+cs[-1])
        else:
            t += 1
    return cs

n = II()
aa = LI()

ll = cost(aa)
if n & 1:
    y = ll[-1]
else:
    rr = cost(aa[::-1])[::-1]
    y = min(l+r for l, r in zip(ll, rr))

print(n//2, y)