#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 1E+05;
struct edge {
    int to, cost, id;
};

ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };

int N;

ll A[2 * MAX_N + 1], B[2 * MAX_N + 1], X[MAX_N + 1], Y[MAX_N + 1];

ll calc(int i, int p)
{
    ll res = 0;
    if (p & 1) {
        res += B[2 * i - 1];
    } else {
        res += A[2 * i - 1];
    }
    if ((p >> 1) & 1) {
        res += B[2 * i];
    } else {
        res += A[2 * i];
    }

    if (p == 3 || p == 0) {
        res += X[i];
    } else {
        res += Y[i];
    }
    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;

    for (int i = 1; i <= 2 * N; ++i) {
        cin >> A[i];
    }
    for (int i = 1; i <= 2 * N; ++i) {
        cin >> B[i];
    }
    for (int i = 1; i <= N; ++i) {
        cin >> X[i];
    }
    for (int i = 1; i <= N; ++i) {
        cin >> Y[i];
    }

    ll ans = 0;
    for (int i = 1; i <= N; ++i) {
        ll res = 0;
        for (int p = 0; p < 4; ++p) {
            chmax(res, calc(i, p));
        }
        ans += res;
    }

    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < N; j++) {
    //         cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
    //     }
    // }

    cout << ans << "\n";

    return 0;
}