import sys
import itertools

def main():
    n = int(sys.stdin.readline())
    a = list(map(int, sys.stdin.readline().split()))
    b = list(map(int, sys.stdin.readline().split()))
    
    dp = {}
    dp[0] = (0, 1)  # (max_sum, count)
    
    for m in range(n):  # current step m (0-based)
        for subset in itertools.combinations(range(n), m):
            mask = sum(1 << j for j in subset)
            if mask not in dp:
                continue
            current_sum, current_count = dp[mask]
            # Next step is (m+1), uses b[m]
            for j in range(n):
                if j not in subset:
                    contribution = max(0, a[j] - b[m])
                    new_sum = current_sum + contribution
                    new_mask = mask | (1 << j)
                    if new_mask not in dp:
                        dp[new_mask] = (new_sum, current_count)
                    else:
                        existing_sum, existing_count = dp[new_mask]
                        if new_sum > existing_sum:
                            dp[new_mask] = (new_sum, current_count)
                        elif new_sum == existing_sum:
                            dp[new_mask] = (new_sum, existing_count + current_count)
    
    final_mask = (1 << n) - 1
    print(dp.get(final_mask, (0, 0))[1])

if __name__ == "__main__":
    main()