def f(x,n,a,b):
    ret = 0
    for i in range(n):
        ret += b[i]*abs(x-a[i])
    return ret

def dx(x,n,a,b):
    ret = 0
    for i in range(n):
        if x > a[i]:
            ret += b[i]
        elif x < a[i]:
            ret -= b[i]
    return ret

def is_ok(arg):
    
    return dx(arg,n,a,b) >= 0


def meguru_bisect(ng, ok):
    '''
    初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
    まずis_okを定義すべし
    ng ok は  とり得る最小の値-1 とり得る最大の値+1
    最大最小が逆の場合はよしなにひっくり返す
    '''
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid):
            ok = mid
        else:
            ng = mid
    return ok

n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

a_max = max(a)
a_min = min(a)

ans = float("Inf")
index = 0
meguru = meguru_bisect(a_min-1,a_max+1)

ans = float("Inf")
p = 0
for i in range(-10,10):
    q = f(meguru+i,n,a,b)
    if q < ans:
        ans = q
        p = meguru+i
print(p,ans)