import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    def ternary_search(high, low):
        """
        f=凸関数の式
        :param high:取りうる一番大きい値
        :param low:取りうる一番小さい値
        :return: 凸関数の極小値（極大値）
        """
        while abs(high - low) > 10 ** (-9):
            mid_left = high / 3 + low * 2 / 3
            mid_right = high * 2 / 3 + low / 3
            if f(mid_left) >= f(mid_right):
                low = mid_left
            else:
                high = mid_right
        return int(high), int(f(high))

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

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

    low, high = -1, 10 ** 9
    print(*ternary_search(high, low))


if __name__ == '__main__':
    resolve()