Balls#7091
In a chest, there are balls of different colors: c_1 balls of the first color, c_2 balls of the second color, ..., and c_n balls of the -th color.
Determine the minimum number of balls that must be drawn blindly from the chest to ensure that you have at least d_1 balls of the first color, at least d_2 balls of the second color, ..., and at least d_n balls of the -th color.
The first line of the input contains a single natural number — the number of different colors of the balls.
The second line contains natural numbers: c_1, c_2, ..., c_n.
The third line contains non-negative integers: d_1, d_2, ..., d_n.
For each natural number where 1 \le j \le n, the condition d_j \le c_j holds true.
No number in the input exceeds .
The output should be a single number — the minimum number of balls required.
Example 1