import java.util.Scanner;
public class Main {
	  public static void main(String[] args) {
	        Scanner sc = new Scanner(System.in);
	        int n = sc.nextInt();
	        long [] a = new long [2 * n + 1];
	        long [] b = new long [2 * n + 1];
	        long [] x = new long [n + 1];
	        long [] y = new long [n + 1];
	        for(int i = 0; i < 2 * n; i++){
	        	a[i] = sc.nextLong();
	        }
	        for(int i = 0; i < 2 * n; i++){
	        	b[i] = sc.nextLong();
	        }
	        for(int i = 0; i < n; i++){
	        	x[i] = sc.nextLong();
	        }
	        for(int i = 0; i < n; i++){
	        	y[i] = sc.nextLong();
	        }
	        long ans = 0;
	        for(int i = 0; i < n; i++){
	        	long tmp = 0;
	        	tmp = Math.max(a[2 * i] + a[2 * i + 1] + x[i], a[2 * i] + b[2 * i + 1] + y[i]);
	        	tmp = Math.max(tmp,  b[2 * i] + a[2 * i + 1] + y[i]);
	        	tmp = Math.max(tmp,  b[2 * i] + b[2 * i + 1] + x[i]);
	        	ans += tmp;
	        }
	        System.out.println(ans);
	    }


}