#include<bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = 2e5 + 10;

int n;
int a[MAXN], b[MAXN], c[MAXN]; 
int f[MAXN][6], g[MAXN][6];
int ans = 0; 

signed main() {
	scanf("%lld", &n);
	for(int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
	for(int i = 1; i <= n; ++i) scanf("%lld", &b[i]);
	for(int i = 1; i <= n; ++i) scanf("%lld", &c[i]);
	for(int i = 1; i <= n; ++i) ans = ans + a[i];
	memset(f, -0x3f, sizeof f);
	memset(g, -0x3f, sizeof g);
	f[0][1] = g[0][1] = 0;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= 5; ++j) {
			f[i][j] = max(f[i - 1][j], f[i - 1][j - 1]) + ((j & 1) ? a[i] : b[i]); 
		}
	}
	for(int j = 1; j <= 5; ++j) {
//		cout << "view: " << j << " " << f[n][j] << "\n"; 
		ans = max(ans, f[n][j]);
	}
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= 5; ++j) {
			int val;
			if(j == 1 || j == 5) val = a[i];
			else if(j == 2 || j == 4) val = b[i];
			else val = c[i];
			for(int k = 1; k <= j; ++k) {
				g[i][j] = max(g[i][j], g[i - 1][k] + val);
			}
		}
	}
	for(int j = 1; j <= 5; ++j) ans = max(ans, g[n][j]);
	printf("%lld\n", ans);
	return 0;
}

/*
?? b,c ????????????????????? 
???????
??????? 0..01..10..01..10..0 ? 0..01..12..21..10..0 ?????
????????? b ??????????? max ??? max??????
??????? 5 ??? DP ??? 
 
*/