import java.util.LinkedHashSet;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	static int n;
	static int[] a, b;
	static TreeMap<Integer, Integer> map;

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		b = new int[n];
		for (int i = 0; i < n; i++) {
			b[i] = sc.nextInt();
		}
		sc.close();

		map = new TreeMap<>();
		permutation(new LinkedHashSet<Integer>());
		System.out.println(map.lastEntry().getValue());
	}

	static void permutation(LinkedHashSet<Integer> set) {
		if (set.size() == n) {
			int sum = 0;
			int j = 0;
			for (int i : set) {
				int val = Math.max(a[i] - b[j], 0);
				sum += val;
				j++;
			}
			map.put(sum, map.getOrDefault(sum, 0) + 1);
			return;
		}

		for (int i = 0; i < n; i++) {
			if (!set.contains(i)) {
				set.add(i);
				permutation(set);
				set.remove(i);
			}
		}
	}
}