#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define whole(v) (v).begin(),(v).end()
#define rwhole(v) (v).rbegin(),(v).rend()
#define Yes cout<<"Yes"<<endl; return 0
#define No cout<<"No"<<endl; return 0
#define vint vector<int>
#define vll vector<ll>
#define vbl vector<bool>
#define vvint vector<vector<int>>
#define vvll vector<vector<ll>>
using namespace std;
using ll = long long;
int mod107 = 1000000007, mod998 = 998244353, inf = 1000000000;
ll infll = 1000000000000000000;
string alphabet = "abcdefghijklmnopqrstuvwxyz", ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

int main() {
	int n;
	cin >> n;
	vll a(2 * n), b(2 * n), x(n), y(n);

	for (int i = 0; i < 2 * n; i++) {
		cin >> a[i];
	}

	for (int i = 0; i < 2 * n; i++) {
		cin >> b[i];
	}

	for (int i = 0; i < n; i++) {
		cin >> x[i];
	}

	for (int i = 0; i < n; i++) {
		cin >> y[i];
	}
	
	ll ans = 0;

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

	cout << ans << endl;
}