/*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);
    }
} import java.util.*; util.* java 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);
    }
} 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);
    } main {
        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);
    } Scanner in = new Scanner(System.in); in new Scanner(System.in) int n = in.nextInt(); n in.nextInt() in.nextInt in int v[] = new int[n]; v new int[n] n for (int i = 0; i < n; ++i){
            v[i] = in.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n ++i ++i i {
            v[i] = in.nextInt();
        } {
            v[i] = in.nextInt();
        } v[i] = in.nextInt() v[i] v i in.nextInt() in.nextInt in int c[] = new int[n]; c new int[n] n for (int i = 0; i < n; ++i){
            c[i] = in.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n ++i ++i i {
            c[i] = in.nextInt();
        } {
            c[i] = in.nextInt();
        } c[i] = in.nextInt() c[i] c i in.nextInt() in.nextInt in int diff diff max_diff = 0; max_diff 0 for (int i = 0; i < n; ++i){
            if ((diff = v[i]-c[i]) > 0){
                max_diff += diff;
            }
        } int i = 0; int i = 0; i 0 i < n i n ++i ++i i {
            if ((diff = v[i]-c[i]) > 0){
                max_diff += diff;
            }
        } {
            if ((diff = v[i]-c[i]) > 0){
                max_diff += diff;
            }
        } if ((diff = v[i]-c[i]) > 0){
                max_diff += diff;
            } (diff = v[i]-c[i]) > 0 (diff = v[i]-c[i]) diff v[i]-c[i] v[i] v i c[i] c i 0 {
                max_diff += diff;
            } max_diff += diff max_diff diff System.out.println(max_diff) System.out.println System.out System System.out max_diff String args[] args 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);
    }
} 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);
    }
} Main
/*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);
    }
}
