Problem Statement

Using integers $A_1,\dots,A_N$ and positive integers $B_1,\dots,B_N$, define a function $f$ whose domain is the real numbers as
$\quad \displaystyle f(X)=\sum_{i=1}^N B_i |X-A_i|$
. Find a real number $X$ that minimizes $f$ and the value of $f(X)$ at that point.

Here, a real number $Y$ that minimizes a function $g$ whose domain is the real numbers is one that satisfies $g(Y) \leq g(Z)$ for every real number $Z$. It can be shown that, under the constraints of this problem, at least one real number minimizing $f$ exists. Note that there may be two or more real numbers minimizing $f$; in that case, you may output any one of them.

It can also be shown that, under the constraints of this problem, the minimum value is an integer.

Note

Constraints

• $1 \leq N \leq 2 \times 10^5$
• $-10^6 \leq A_i \leq 10^6$
• $1 \leq B_i \leq 10^6$
• All inputs are integers.

Input

$N$
$A_1~A_2~\dots~A_N$
$B_1~B_2~\dots~B_N$

Output

Output $X$ that minimizes $f$ and the value of $f(X)$ at that point. Separate these two numbers with a space, and end the output with a newline.

Sample

1
0
1

0 0

3
1 2 3
1 2 3

2 4

10
1 1 2 3 5 8 13 21 34 55
1 2 3 4 5 1 2 3 4 5

7.5 462