import bisect
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

m = (sum(B) + 1)//2
AB = sorted(zip(A, B))

for a, b in AB:
    m -= b
    if m <= 0:
        i = a
        break

ans = sum(b * abs(i - a) for a, b in AB)
print(i, ans)