Distribution
For the planned attack on settlements inhabited by humans, elves, and dwarves, the Horde's leader, Orgrim Doomhammer, organized all available warriors into N distinct units, which were dispatched for conquest. However, scouts have just returned with reports on the enemy forces present in these settlements, prompting Orgrim to revise his strategy. He now intends to redistribute the troops among the units by transferring warriors from one unit to another. To prevent disorder within his army and to expedite the redistribution process, the number of such transfers should be minimized (each transfer involves moving one soldier from one unit to another).
Write a program to determine the minimum number of transfers required to achieve the desired redistribution of troops.
Input
The first line of the input contains an integer N (1 ≤ N ≤ 10000) — the number of units. The second line provides the initial distribution of warriors across the units — N numbers, each indicating the number of warriors in the corresponding unit. The third line specifies the desired distribution of soldiers. The number of soldiers in any unit does not exceed 10^6. It is guaranteed that the total number of warriors in the initial distribution matches the total in the desired distribution.
Output
Output the minimum number of transfers needed.