#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=510;
const int maxm=20;

int f[maxm][maxn][maxn];
int a[maxm],b[maxm],c[maxm],d[maxm],e[maxm];

int f1(int x) {return (x<0)?0:x;}
int f2(int x) {return (x<0)?-x:0;}

int main()
{
    freopen("asm_grenade.in","r",stdin);
    freopen("asm_grenade.out","w",stdout);
    memset(f,-1,sizeof(f));
    int n,t,k0,k1,k2;scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++) scanf("%d",&b[i]);
    for(int i=1;i<=n;i++) scanf("%d",&c[i]);
    for(int i=1;i<=n;i++) scanf("%d",&d[i]);
    for(int i=1;i<=n;i++) scanf("%d",&e[i]);
    scanf("%d%d%d",&k0,&k1,&k2);f[0][k0][k1]=k2;
    for(int i=0;i<=n;i++)
    {
        for(int j=140;j>=0;j--)
        {
            for(int k=140;k>=0;k--)
            {
                if(f[i][j][k]==-1) continue;
                f[i+1][j][k]=f[i][j][k];
                t=f[i+1][f1(j-a[i+1])+c[i+1]][f1(k-b[i+1])+d[i+1]];
                if(f[i][j][k]>=f2(j-a[i+1])+f2(k-b[i+1]))
                {
                    f[i+1][f1(j-a[i+1])+c[i+1]][f1(k-b[i+1])+d[i+1]]
                    =max(f[i][j][k]-f2(j-a[i+1])-f2(k-b[i+1])+e[i+1],t);
                }
            }
        }
    }
    int ans=-1;
    for(int j=0;j<=140;j++)
    {
        for(int k=0;k<=140;k++)
        {
            if(f[n][j][k]>=0) ans=max(ans,j+k+f[n][j][k]);
        }
    }
    printf("%d\n",ans);
    return 0;
}