#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(),x.end() 
typedef long long ll;
//using mint = modint;
using mint = modint998244353;
using P = pair<int, int>;

const ll INF=1LL<<60, dx[]={0,1,0,-1},dy[]={1,0,-1,0};
template <typename T> inline bool chmin(T& a,const T&b) {if(a>b){a=b; return 1;} return 0;}
template <typename T> inline bool chmax(T& a,const T&b) {if(a<b){a=b; return 1;} return 0;}

int main(){

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

    ll ans=0;
    rep(i,n) {
        ll rr,rb,br,bb;
        rr = a[2*i]+a[2*i+1]+x[i];
        rb = a[2*i]+b[2*i+1]+y[i];
        br = b[2*i]+a[2*i+1]+y[i];
        bb = b[2*i]+b[2*i+1]+x[i];
        ans += max(max(max(rr,rb),br),bb);
    }
    cout << ans << endl;

    return 0;
}