#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL

int main(){
	
	int n;
	cin>>n;
	vector<long long> a(n),b(n),c(n);
	rep(i,n)cin>>a[i];
	rep(i,n)cin>>b[i];
	rep(i,n)cin>>c[i];
	long long ans = 0;
	//A* B* C+ B* A*
	{
		vector<long long> dp(5,-Inf64);
		dp[0] = 0,dp[1] = 0,dp[2] = 0;
		rep(i,n){
			vector<long long> ndp(5,-Inf64);
			rep(j,5){
				long long nv = dp[j];
				if(j==0 || j==4)nv += a[i];
				if(j==1 || j==3)nv += b[i];
				if(j==2)nv += c[i];
				for(int k=j;k<5;k++){
					if(j<2&&k>2)continue;
					ndp[k] = max(ndp[k],nv);
				}
			}
			swap(dp,ndp);
		}
		for(int i=2;i<5;i++)ans = max(ans,dp[i]);
	}
	
	//A* B+ A* B+ A*
	{
		vector<long long> dp(5,-Inf64);
		dp[0] = 0,dp[1] = 0;
		rep(i,n){
			vector<long long> ndp(5,-Inf64);
			rep(j,5){
				long long nv = dp[j];
				if(j==0 || j==2 || j==4)nv += a[i];
				if(j==1 || j==3)nv += b[i];
				for(int k=j;k<5;k++){
					if(j<1&&k>1)continue;
					if(j<3&&k>3)continue;
					ndp[k] = max(ndp[k],nv);
				}
			}
			swap(dp,ndp);
		}
		for(int i=3;i<5;i++)ans = max(ans,dp[i]);
	}
	
	cout<<ans<<endl;
	
	return 0;
	
}