def f(x):
    S=0
    for k in range(N):
        S+=B[k]*abs(x-A[k])
    return S

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

#===制約チェック
assert 1<=N<=2*10**5
assert len(A)==N
assert len(B)==N

for i in range(N):
    assert -10**6<=A[i]<=10**6
    assert 1<=B[i]<=10**6
#===

B_sum=sum(B)

L=[0]*N
for k in range(N):
    L[k]=(A[k],B[k])

L.sort(key=lambda x:x[0])

if B_sum%2:
    Med=(B_sum+1)//2
    Count=0

    for (X,Y) in L:
        Count+=Y
        if Med<=Count:
            break
    alpha=beta=X
else:
    alpha=beta=None

    Med=(B_sum+1)//2
    Count=0
    for (X,Y) in L:
        Count+=Y
        if Med<=Count and alpha==None:
            alpha=X
        if Med+1<=Count and beta==None:
            beta=X

print(alpha,beta,f(alpha))