import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    n = ini()
    A = inl()
    B = inl()

    P = []
    for i in range(n):
        P.append((A[i], B[i]))
    P.sort()

    if n == 1:
        return A[0], 0

    cum = [None] * (n + 1)
    cum[0] = 0
    for i in range(n):
        cum[i + 1] = cum[i] + P[i][1]

    # mp = 0
    # for i in range(n):
    #     if cum[i] <= cum[n] - cum[i + 1] and cum[i + 1] > cum[n] - cum[i + 1]:
    #         mp = i
    #         break
    #     if i < n - 1 and cum[i + 1] == cum[n] - cum[i + 1]:
    #         mp = i
    #         break

    def f(x):
        res = 0
        for i in range(n):
            res += B[i] * abs(x - A[i])
        return res

    lo, hi, minima = min(A) - 1, max(A) + 1, None
    for _ in range(300):
        mid = (lo + hi) / 2.0
        s = 0
        i = 0
        while P[i][0] < mid:
            s += P[i][1]
            i += 1
        if s <= cum[n] - cum[i + 1]:
            lo = mid
        else:
            hi = mid

        # fx, fy = f(x), f(y)
        # if fx > fy:
        #     lo = x
        #     minima = fy
        # else:
        #     hi = y
        #     minima = fx

    return lo, int(f(lo) + 0.5)

    # if mp == n - 1:
    #     return P[mp][0], int(f(P[mp][0]) + 0.5)
    # if f(P[mp][0]) <= f(P[mp + 1][0]):
    #     return P[mp][0], int(f(P[mp][0]) + 0.5)
    # else:
    #     return P[mp + 1][0], int(f(P[mp + 1][0]) + 0.5)


print(*solve())