#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>#define ll long long
using namespace std;
const int maxn=5005;
int n,i,t,j,k,l;
ll a[maxn],b[maxn],c[maxn],d[maxn],f[maxn][maxn],x[maxn],p;
int main(){
// freopen("data.in","r",stdin);
scanf("%d",&n); for (i=1;i<=n;i++) scanf("%lld",&x[i]); for (i=1;i<=n;i++) scanf("%lld",&a[i]); for (i=1;i<=n;i++) scanf("%lld",&b[i]); for (i=1;i<=n;i++) scanf("%lld",&c[i]); for (i=1;i<=n;i++) scanf("%lld",&d[i]); memset(f,128,sizeof(f));f[0][0]=0;p=f[1][1]; for (i=0;i<n;i++) for (j=0;j<=i;j++){ if (f[i][j]==p) continue; if (i){ if (j) {f[i+1][j-1]=max(f[i][j]+x[i+1]*2+a[i+1]+c[i+1],f[i+1][j-1]); if (i!=n-1){ f[i+1][j]=max(f[i][j]+a[i+1]+d[i+1],f[i+1][j]); f[i+1][j]=max(f[i][j]+b[i+1]+c[i+1],f[i+1][j]); } } } if (i!=n-1) f[i+1][j+1]=max(f[i][j]+b[i+1]+d[i+1]-x[i+1]*2,f[i+1][j+1]); } printf("%lld",f[n][0]);
}