

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		used = new boolean[n];
		v = new int[n];
		c = new int[n];

		for(int i = 0; i < n; i++){
			v[i] = sc.nextInt();
		}

		for(int i = 0; i < n; i++){
			c[i] = sc.nextInt();
		}

		System.out.println(dfs(0, n));

	}

	static boolean used[];
	static int v[];
	static int c[];

	static int dfs(int depth, int n){
		if(depth == n){
			int result = 0;
			for(int i = 0; i < n; i++){
				if(used[i]){
					result += v[i] - c[i];
				}
			}

			return result;
		}

		int result = Integer.MIN_VALUE;;
		used[depth] = false;
		result = Math.max(result, dfs(depth + 1, n));
		used[depth] = true;
		result = Math.max(result, dfs(depth + 1, n));

		return result;
	}
}

/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