from itertools import accumulate
from bisect import bisect_left
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
Q=[]
for i in range(N):
  Q.append([A[i],B[i]])
Q=sorted(Q)
QB=[Q[i][1] for i in range(N)]
BA=list(accumulate(QB))
num=(BA[-1]+1)//2
idx=bisect_left(BA,num)
ans=0
for i in range(N):
  ans+=Q[i][1]*abs(Q[idx][0]-Q[i][0])
print(Q[idx][0],ans)