#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        int n;
        cin >> n;
        vector<ll>a(2 * n), b(2 * n);
        for (int i = 0; i < 2 * n; i++)cin >> a[i];
        for (int i = 0; i < 2 * n; i++)cin >> b[i];
        vector<ll>x(n), y(n);
        for (int i = 0; i < n; i++)cin >> x[i];
        for (int i = 0; i < n; i++)cin >> y[i];
        ll ans = 0;
        vector < vector<ll>>p(2 * n, vector<ll>(2));
        p[0][0] = a[0]; p[0][1] = b[0];
        for (int i = 1; i < n*2; i++) {
            if (i % 2) {
                p[i][0] = max(p[i - 1][0] + a[i] + x[i/2 ], p[i - 1][1] + a[i]+y[i/2]);
                p[i][1] = max(p[i - 1][0] + b[i] + y[i/2 ], p[i - 1][1] + b[i] + x[i/2 ]);
            }
            else {
                p[i][0] = ans + a[i];
                p[i][1] = ans + b[i];
            }
            ans = max(p[i][0], p[i][1]);
        }
        
        
        cout << ans;
    }
        return 0;
}