import java.lang.reflect.Array;
import java.util.*;

/**
 * Created by Santa.
 */
public class Main {

  static int N;
  static int K;
  static long Q;
  static int A;
  static int B;
  static long C;
  static double min = 9999999;
  static long ans = 0;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  }
} import java.lang.reflect.Array; Array java.lang.reflect import java.util.*; util.* java public class Main {

  static int N;
  static int K;
  static long Q;
  static int A;
  static int B;
  static long C;
  static double min = 9999999;
  static long ans = 0;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  }
} Main static int N; N static int K; K static long Q; Q static int A; A static int B; B static long C; C static double min = 9999999; min 9999999 static long ans = 0; ans 0 public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  } main {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner 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] = scanner.nextInt();


    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      V[i] = scanner.nextInt();


    } {
      V[i] = scanner.nextInt();


    } V[i] = scanner.nextInt() V[i] V i scanner.nextInt() scanner.nextInt scanner for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      C[i] = scanner.nextInt();

    } {
      C[i] = scanner.nextInt();

    } C[i] = scanner.nextInt() C[i] C i scanner.nextInt() scanner.nextInt scanner 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 System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {

  static int N;
  static int K;
  static long Q;
  static int A;
  static int B;
  static long C;
  static double min = 9999999;
  static long ans = 0;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  }
} public class Main {

  static int N;
  static int K;
  static long Q;
  static int A;
  static int B;
  static long C;
  static double min = 9999999;
  static long ans = 0;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  }
} Main
import java.lang.reflect.Array;
import java.util.*;

/**
 * Created by Santa.
 */
public class Main {

  static int N;
  static int K;
  static long Q;
  static int A;
  static int B;
  static long C;
  static double min = 9999999;
  static long ans = 0;

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);


    int N = scanner.nextInt();

    int[] V = new int[N];
    int[] C = new int[N];
    for (int i = 0; i < N; i++) {
      V[i] = scanner.nextInt();


    }

    for (int i = 0; i < N; i++) {
      C[i] = scanner.nextInt();

    }

    for (int i = 0; i < N; i++) {
      ans += Math.max(0, V[i] - C[i]);
    }

    System.out.println(ans);

  }
}
