import java.util.*;
import java.math.*;
import java.io.*;


public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz