#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x&-x)
using namespace std;
const int N = 5e3+7, inf = 1e9+7;
ll f[N][N];
ll x[N], a[N], b[N], c[N], d[N];
int main()
{
    int n;
    freopen("AABD.in", "r", stdin);
    freopen("AABD.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%lld", &x[i]);
    }
    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++)
    {
        scanf("%lld", &d[i]);
    }
    memset(f, 0xcf, sizeof(f));
    f[0][0] = 0;
    for(int i = 1; i <= n; i++)
    {
        f[i][1] = max(f[i][1], f[i-1][0]+b[i]+d[i]-2*x[i]);
        for(int j = 1; j < i; j++)
        {
            f[i][j] = max(f[i][j], f[i-1][j]+a[i]+d[i]);
            f[i][j] = max(f[i][j], f[i-1][j]+b[i]+c[i]);
            f[i][j-1] = max(f[i][j-1], f[i-1][j]+a[i]+c[i]+2*x[i]);
            f[i][j+1] = max(f[i][j+1], f[i-1][j]+b[i]+d[i]-2*x[i]);
        }
    }
    printf("%lld\n", f[n][0]);
    return 0;
}