// naive (TLE)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;

int main() {
    ll n; cin >> n;
    vector<ll> a(n), b(n), c(n);
    for (size_t i=0; i<n; i++) cin >> a[i];
    for (size_t i=0; i<n; i++) cin >> b[i];
    for (size_t i=0; i<n; i++) cin >> c[i];
    ll ans = -INF;
    for (size_t l1=0; l1<n; l1++) for (size_t r1=l1; r1<=n; r1++) for (size_t l2=0; l2<n; l2++) for (size_t r2=l2; r2<=n; r2++) {
        vector<ll> cnt(n);
        for (size_t i = l1; i<r1; i++) cnt[i]++;
        for (size_t i = l2; i<r2; i++) cnt[i]++;
        ll cur = 0;
        for (size_t i = 0; i<n; i++) {
            if (cnt[i] == 0) cur += a[i];
            else if (cnt[i] == 1) cur += b[i];
            else cur += c[i];
        }
        ans = max(ans, cur);
    }
    cout << ans << "\n";
}