import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

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

		int N = keyboard.nextInt();
		
		int[] X = new int[N];
			for(int i=0; i < N; i++) {
				X[i] = keyboard.nextInt();
			}
		int[] Y = new int[N];
			for(int j=0; j < N; j++) {
				Y[j] = keyboard.nextInt();
			}
			
		int[] sagaku = new int[N];
		for(int k=0; k < N; k++) {
			sagaku[k] = X[k] - Y[k];
		}
		
		int Max = 0;
		
		for(int l=0; l < N; l++) {	
			if(sagaku[l] + Max > Max) {
				Max += sagaku[l];
				}
		}

		System.out.print(Max);
		keyboard.close();	
	}
}

/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