def f(n, a):
    assert n % 2 == 0
    ptr = 0
    d = [0]
    n2 = n // 2
    for i in range(1, n, 2):
        while a[ptr] > n2:
            ptr += 1
        d.append(d[-1] + abs(i - ptr))
        ptr += 1
    return d

n = int(input())
a = list(map(int, input().split()))
if n % 2 == 0:
    df = f(n, a)
    db = f(n, a[::-1])[::-1]
    ans = min(map(sum, zip(df, db)))
    print(n // 2, ans)
else:
    n2 = n // 2
    ptr = 0
    ans = 0
    for i in range(1, n, 2):
        while a[ptr] > n2:
            ptr += 1
        ans += abs(i - ptr)
        ptr += 1
    print(max(1, n2), ans)