//g++ 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

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

  int n;cin>>n;
  vll a(2*n),b(2*n),x(n),y(n);
  rep(i,0,2*n)cin>>a[i];
  rep(i,0,2*n)cin>>b[i];
  rep(i,0,n)cin>>x[i];
  rep(i,0,n)cin>>y[i];

  ll ans=0;
  rep(i,0,n){
    ll mx=0;
    rep(j,0,2){
      rep(k,0,2){
        ll f=0;

        if(j==0){
          f+=a[2*i];
        }
        else{
          f+=b[2*i];
        }

        if(k==0){
          f+=a[2*i+1];
        }
        else{
          f+=b[2*i+1];
        }

        if(j==k){
          f+=x[i];
        }
        else{
          f+=y[i];
        }

        mx=max(mx,f);
      }
    }

    ans+=mx;
  }

  cout<<ans<<endl;
}