#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<vector<long long>> ab(2, vector<long long>(2 * n));
    vector<long long> x(n), y(n);
    for (int i = 0; i < 2 * n; i++) cin >> ab[0][i];
    for (int i = 0; i < 2 * n; i++) cin >> ab[1][i];
    for (int i = 0; i < n; i++) cin >> x[i];
    for (int i = 0; i < n; i++) cin >> y[i];

    long long ans = 0;
    for (int i = 0; i < n; i++) {
        int l = 2 * i, r = 2 * i + 1;
        long long now = 0;
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                now = max(now, ab[j][l] + ab[k][r] + (j == k ? x[i] : y[i]));
            }
        }
        ans += now;
    }

    cout << ans << '\n';
}

int main() {
    int q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
}