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

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.

Input

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

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is the amount of soda remaining in the i-th bottle.

The third line contains n positive integers b1, b2, ..., bn (1 ≤ bi ≤ 100), where bi is the volume of the i-th bottle.

It is guaranteed that ai ≤ bi for any i.

Output

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.

Examples

Input

4
3 3 4 3
4 7 6 5


Output

2 6


Input

2
1 1
100 100


Output

1 1


Input

5
10 30 5 6 24
10 41 7 8 24


Output

3 11

Note

In the first example Nick can pour soda from the first bottle to the second bottle. It will take 3 seconds. After it the second bottle will contain 3 + 3 = 6 units of soda. Then he can pour soda from the fourth bottle to the second bottle and to the third bottle: one unit to the second and two units to the third. It will take 1 + 2 = 3 seconds. So, all the soda will be in two bottles and he will spend 3 + 3 = 6 seconds to do it.
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Vector;
import java.util.regex.Matcher;
import java.util.regex.Pattern;



public class ACM1J {

	static StringTokenizer st;
	static BufferedReader br;
	static PrintWriter pw;

	static class Sort implements Comparable<Sort> {
		int ind, a;

		@Override
		public int compareTo(Sort o) {
			return a - o.a;
		}
		public Sort(int i, int an) {
			ind = i;
			a = an;
		}
	}
	
	static int n;
	static int[] a, b, sa;
	static int[][] d;
	static int k, t, sum = 0;
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		n = nextInt();
		a = new int [n];
		b = new int [n];
		sa = new int [n];
		for (int i = 0; i < n; ++i) {
			b[i] = nextInt();
			sum += b[i];
		}
		for (int i = 0; i < n; ++i) {
			a[i] = nextInt();
			sa[i] = -a[i];
		}
		Arrays.sort(sa);
		int sumk = 0;
		for (int i = 0; i < n; ++i) {
			sumk -= sa[i];
			if (sumk >= sum) {
				k = i + 1;
				break;
			}
		}
		int max = k * 100;
		d = new int [k + 1][max + 1];
		for (int i = 0; i <= k; ++i)
			Arrays.fill(d[i], -1);
		d[0][0] = 0;
		for (int i = 0; i < n; ++i) {
			for (int j = k; j > 0; --j) {
				for (int m = max; m > 0; --m) {
					if (m - a[i] >= 0 && d[j - 1][m - a[i]] != -1) {
						d[j][m] = Math.max(d[j][m], d[j - 1][m - a[i]] + b[i]);
					}
				}
			}
		}
		int maxa = 0;
		for (int i = sum; i <= max; ++i) {
			maxa = Math.max(d[k][i], maxa);
		}
		pw.println(k + " " + (sum - maxa));
		pw.close();
	}
	

	private static int sumf(int[] fen, int id) {
		int summ = 0;
		for (; id >= 0; id = (id & (id + 1)) - 1) 
 			summ += fen[id];
		return summ;
	}

	private static void addf(int[] fen, int id) {
		for (; id < fen.length; id |= id + 1) 
			fen[id]++;
	}

	private static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	private static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
	private static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}
	private static String next() throws IOException {
		while (st==null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}
}