/*https://atcoder.jp/contests/abc125/tasks/abc125_a*/

import java.util.*;

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

        int diff, max_diff = 0;

        // 宝石ごとに価値-コストが正か調べる
        for (int i = 0; i < n; ++i){
            if ((diff = v[i]-c[i]) > 0){
                max_diff += diff;
            }
        }
        System.out.println(max_diff);
    }
}

/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