#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int N;
ll A[202020], B[202020], X[202020], Y[202020];

int main() {
  cin >> N;
  for (int i = 1; i <= 2 * N; i++) cin >> A[i];
  for (int i = 1; i <= 2 * N; i++) cin >> B[i];
  for (int i = 1; i <= N; i++) cin >> X[i];
  for (int i = 1; i <= N; i++) cin >> Y[i];
  ll ans = 0;
  for (int i = 1; i <= N; i++) {
    ans += max({A[2 * i - 1] + A[2 * i] + X[i], A[2 * i - 1] + B[2 * i] + Y[i], 
            B[2 * i - 1] + A[2 * i] + Y[i], B[2 * i - 1] + B[2 * i] + X[i]});
  }
  cout << ans << endl;
  return 0;
}