import java.io.PrintStream;
import java.util.Scanner;

public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    }
    
    static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
        
       
    static int ni() {
        return sc.nextInt();
    }
    
    static long nl() {
        return sc.nextLong();
    }

    static char[] nsToChars() {
        return sc.next().toCharArray();
    }
} import java.io.PrintStream; PrintStream java.io import java.util.Scanner; Scanner java.util public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    }
    
    static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
        
       
    static int ni() {
        return sc.nextInt();
    }
    
    static long nl() {
        return sc.nextLong();
    }

    static char[] nsToChars() {
        return sc.next().toCharArray();
    }
} Main static final PrintStream so = System.out; so System.out System System.out static final Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    } main {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    } int N = ni(); N ni() ni int[] V = new int[N]; V new int[N] N int[] C = new int[N]; C new int[N] N for (int i = 0; i < N; i++) {
            V[i] = ni();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            V[i] = ni();
        } {
            V[i] = ni();
        } V[i] = ni() V[i] V i ni() ni for (int i = 0; i < N; i++) {
            C[i] = ni();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            C[i] = ni();
        } {
            C[i] = ni();
        } C[i] = ni() C[i] C i ni() ni int ans = 0; ans 0 for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            ans += Math.max(0, V[i] - C[i]);
        } {
            ans += Math.max(0, V[i] - C[i]);
        } ans += Math.max(0, V[i] - C[i]) ans Math.max(0, V[i] - C[i]) Math.max Math 0 V[i] - C[i] V[i] V i C[i] C i so.println(ans) so.println so ans String[] args args static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    } gcd {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    } if(m < n) return gcd(n, m); m < n m n return gcd(n, m); gcd(n, m) gcd n m if(n == 0) return m; n == 0 n 0 return m; m return gcd(n, m % n); gcd(n, m % n) gcd n m % n m n long m m long n n static int ni() {
        return sc.nextInt();
    } ni {
        return sc.nextInt();
    } return sc.nextInt(); sc.nextInt() sc.nextInt sc static long nl() {
        return sc.nextLong();
    } nl {
        return sc.nextLong();
    } return sc.nextLong(); sc.nextLong() sc.nextLong sc static char[] nsToChars() {
        return sc.next().toCharArray();
    } nsToChars {
        return sc.next().toCharArray();
    } return sc.next().toCharArray(); sc.next().toCharArray() sc.next().toCharArray sc.next() sc.next sc public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    }
    
    static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
        
       
    static int ni() {
        return sc.nextInt();
    }
    
    static long nl() {
        return sc.nextLong();
    }

    static char[] nsToChars() {
        return sc.next().toCharArray();
    }
} public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    }
    
    static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
        
       
    static int ni() {
        return sc.nextInt();
    }
    
    static long nl() {
        return sc.nextLong();
    }

    static char[] nsToChars() {
        return sc.next().toCharArray();
    }
} Main
import java.io.PrintStream;
import java.util.Scanner;

public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        int N = ni();
        int[] V = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            V[i] = ni();
        }
        for (int i = 0; i < N; i++) {
            C[i] = ni();
        }
        
        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans += Math.max(0, V[i] - C[i]);
        }
        so.println(ans);
    }
    
    static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
        
       
    static int ni() {
        return sc.nextInt();
    }
    
    static long nl() {
        return sc.nextLong();
    }

    static char[] nsToChars() {
        return sc.next().toCharArray();
    }
}
