#include<cstdio>
using namespace std;
int s[200][200]={0};
int O[200][200]={0};
int a[15]={0},b[15]={0},A[15]={0},B[15]={0},C[15]={0};
int main()
{
	freopen("asm_grenade.in","r",stdin);
	freopen("asm_grenade.out","w",stdout);
	int n;
	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",&A[i]);
	for (int i=1;i<=n;i++) scanf("%d",&B[i]);
	for (int i=1;i<=n;i++) scanf("%d",&C[i]);
	int k0,k1,k2;
	scanf("%d%d%d",&k0,&k1,&k2);
	s[k0][k1]=k2; 
	for (int j=0;j<=160;j++)
		for (int k=0;k<=160;k++)
			O[j][k]=-1;
	O[k0][k1]=0;
	for (int i=1;i<=n;i++)
	{
		int x=a[i],y=b[i];
		for (int j=0;j<=160;j++)
			for (int k=0;k<=160;k++)
			if (O[j][k]!=-1&&O[j][k]!=i) 
			{
				if (j-x<=0&&k-y<=0&&s[j][k]+j+k-x-y>=0&&s[A[i]][B[i]]<=s[j][k]+(j-x+k-y)+C[i]) 
				{
					s[A[i]][B[i]]=s[j][k]+(j-x+k-y)+C[i];
					O[A[i]][B[i]]=i;
				}
				if (j-x>=0&&k-y<=0&&s[j][k]+k-y>=0&&s[A[i]+j-x][B[i]]<=s[j][k]+(k-y)+C[i]) 
				{
					s[A[i]+j-x][B[i]]=s[j][k]+(k-y)+C[i];
					O[A[i]+j-x][B[i]]=i;
				}
				if (j-x>=0&&k-y>=0&&s[A[i]+j-x][B[i]+k-y]<=s[j][k]+C[i])   
				{
					s[A[i]+j-x][B[i]+k-y]=s[j][k]+C[i];  
					O[A[i]+j-x][B[i]+k-y]=i;
				}
				if (j-x<=0&&k-y>=0&&s[j][k]+j-x>=0&&s[A[i]][B[i]+k-y]<=s[j][k]+(j-x)+C[i]) 
				{
					s[A[i]][B[i]+k-y]=s[j][k]+(j-x)+C[i];
					O[A[i]][B[i]+k-y]=i;
				}
			}
		/*for (int j=0;j<=160;j++)
			for (int k=0;k<=160;k++)
				if (O[j][k]!=-1)printf("%d %d %d\n",j,k,s[j][k]);
		printf("\n\n\n\n\n");*/
	}
	long long max=0;
	for (int i=0;i<=160;i++)
		for (int j=0;j<=160;j++)
			if (O[i][j]!=-1&&i+j+s[i][j]>max) max=i+j+s[i][j];
	printf("%lld",max);
}