#ifdef MY_LOCAL
#include "D://competitive_programming/debug/debug.h"
#define debug(x) cerr << "[" << #x<< "]:"<<x<<"\n"
#else
#define debug(x) 
#endif
#define REP(i, n) for(int i = 0; i < n; i ++)
#define REPL(i,m, n) for(int i = m; i < n; i ++)
#define SORT(arr) sort(arr.begin(), arr.end())
#define LSOne(S) ((S)&-(S))
#define M_PI 3.1415926535897932384
#define INF 1e18
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef double ld;
typedef tree<int,null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ost;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;cin>>n;
	vi arrA(2*n);
	vi arrB(2*n);
	vi arrX(n);
	vi arrY(n);
	REP(i, 2*n) {
		cin>>arrA[i];
	}
	REP(i, 2*n) {
		cin>>arrB[i];
	}
	REP(i, n) {
		cin>>arrX[i];
	}
	REP(i, n) {
		cin>>arrY[i];
	}
	int tot = 0;
	REP(i, n) {
		int bst = max(arrX[i] + max(arrA[2*i] + arrA[2*i+1], arrB[2*i]+arrB[2*i+1]),
			arrY[i] + max(arrA[2*i] + arrB[2*i+1], arrB[2*i]+arrA[2*i+1]));
		tot += bst;
	}
	cout<<tot<<"\n";
}