#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <deque>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
using ll = long long;
using ld = long double;

int main(){
    int n; cin >> n;
    vector<ll> a(n*2), b(n*2);
    for(auto &it: a) cin >> it;
    for(auto &it: b) cin >> it;
    vector<ll> x(n), y(n);
    for(auto &it: x) cin >> it;
    for(auto &it: y) cin >> it;

    ll ans = 0;
    for(int i = 0; i < n; i++){
        ans += max(max(a[i*2]+a[i*2+1], b[i*2]+b[i*2+1])+x[i],
        max(a[i*2]+b[i*2+1], b[i*2]+a[i*2+1])+y[i]);
    }
    cout << ans << endl;
    return 0;
}