Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda a_i and bottle volume b_i (a_i≤b_i).

Nick has decided to pour all remaining soda into minimal number of bottles, moreover he has to do it as soon as possible. Nick spends x seconds to pour x units of soda from one bottle to another.

Nick asks you to help him to determine k − the minimal number of bottles to store all remaining soda and t − the minimal time to pour soda into k bottles. A bottle can't store more soda than its volume. All remaining soda should be saved.

The first line contains positive integer n (1≤n≤100) − the number of bottles.

The second line contains n positive integers a₁,a₂,...,a_n (1≤a_i≤100), where a_i is the amount of soda remaining in the i-th bottle.

The third line contains n positive integers b₁,b₂,...,b_n (1≤b_i≤100), where b_i is the volume of the i-th bottle.

It is guaranteed that a_i≤b_i for any i.

The only line should contain two integers k and t, where k is the minimal number of bottles that can store all the soda and t is the minimal time to pour the soda into k bottles.