N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
f = 1
M = -1
cnt = 0
for i in range(N):
    f *= i + 1
for i in range(f):
    perm = [i for i in range(N)]
    L = [0]*N
    tmp = i
    for j in range(N):
        L[N-1-j] = tmp % (j+1)
        tmp //= j + 1
    LL = [0]*N
    for j in range(N):
        LL[j] = perm[L[j]]
        for k in range(L[j], N-j-1):
            perm[k] = perm[k+1]
    S = 0
    for i in range(N):
        S += max(0, A[LL[i]] - B[i])
    if M < S:
        cnt = 1
        M = S
    elif M == S:
        cnt += 1
print(cnt)