#!/usr/bin/env python
import sys
sys.setrecursionlimit(1000000000)

#
# Solution Template for Spaceship Shuffle
# 
# Australian Informatics Olympiad 2022
# 
# This file is provided to assist with reading and writing of the input
# files for the problem. You may modify this file however you wish, or
# you may choose not to use this file at all.
#

# N is the number of cabins.
N = None

# A contains the initial number of crewmates in each cabin. Note that here the
# cabins are numbered starting from 0.
A = []

# B contains the desired number of crewmates in each cabin. Note that here the
# cabins are numbered starting from 0.
B = []

answer = None

# Open the input and output files.
input_file = open("spacein.txt", "r")
output_file = open("spaceout.txt", "w")

# Read the value of N.
N = int(input_file.readline().strip())

# Read the values of A and B.
input_line = input_file.readline().strip()
A = list(map(int, input_line.split()))
input_line = input_file.readline().strip()
B = list(map(int, input_line.split()))

# TODO: This is where you should compute your solution. Store the fewest
# dollars you must pay before you can depart into the variable answer.

# Write the answer to the output file.
output_file.write("%d\n" % (answer))

# Finally, close the input/output files.
input_file.close()
output_file.close()