There are N gems. The value of the i-th gem is V_i.

You will choose some of these gems, possibly all or none, and get them.

However, you need to pay a cost of C_i to get the i-th gem.

Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.

Find the maximum possible value of X-Y.

Constraints

* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq C_i, V_i \leq 50

Input

Input is given from Standard Input in the following format:


N
V_1 V_2 ... V_N
C_1 C_2 ... C_N


Output

Print the maximum possible value of X-Y.

Examples

Input

3
10 2 5
6 3 4


Output

5


Input

4
13 21 6 19
11 30 6 15


Output

6


Input

1
1
50


Output

0
import java.util.Scanner;

class Main {

    public static void main(String args[]){
      Scanner sc = new Scanner(System.in);
      int num = Integer.parseInt(sc.nextLine());
      String values = sc.nextLine();
      String costs = sc.nextLine();

      int result = 0;
      for(int i= 0; i<num; i++){
        int v = Integer.parseInt(values.split(" ")[i]);
        int c = Integer.parseInt(costs.split(" ")[i]);
        if(v>c) result += v-c;
      }
      System.out.println(result);
    }


}