#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<ll> a(2*n), b(2*n), x(n), y(n);
    for(int i = 0; i < 2*n; i++) cin >> a[i];
    for(int i = 0; i < 2*n; i++) cin >> b[i];
    for(int i = 0; i < n; i++) cin >> x[i];
    for(int i = 0; i < n; i++) cin >> y[i];
    auto dp = vec2d(2*n, 2, 0ll);
    dp[0][0] = a[0];
    dp[0][1] = b[0];
    for(int i = 1; i < 2*n; i++){
        vector<ll> gain = {a[i], b[i]};
        for(int j = 0; j < 2; j++){
            for(int k = 0; k < 2; k++){
                ll bonus = 0;
                if(i%2 == 1) bonus = j == k ? x[i/2] : y[i/2];
                chmax(dp[i][k], dp[i-1][j]+gain[k]+bonus);
            }
        }
    }
    cout << max(dp[2*n-1][0], dp[2*n-1][1]) << endl;
}