#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

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

    vector<ll> a(2*n), b(2*n);
    rep(i, 2*n) cin >> a[i];
    rep(i, 2*n) cin >> b[i];

    vector<ll> x(n), y(n);
    rep(i, n) cin >> x[i];
    rep(i, n) cin >> y[i];

    ll ans = 0;
    rep(i, n){
        ll sa = 0;
        sa = max(sa, a[2*i]+a[2*i+1]+x[i]);
        sa = max(sa, a[2*i]+b[2*i+1]+y[i]);
        sa = max(sa, b[2*i]+a[2*i+1]+y[i]);
        sa = max(sa, b[2*i]+b[2*i+1]+x[i]);
        ans += sa;
    }

    cout << ans << endl;
}