import itertools
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort(reverse=True)
b.sort()
l = []
for i in itertools.permutations(range(n)):
    cost = 0
    for j,x in enumerate(i):
        if a[x] > b[j]:
            cost += a[x]-b[j]
    l.append(cost)
print(l.count(max(l)))