#include<iostream>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<cctype>
#include<map>
#include<vector>
#include<cstring>
#include<cstdlib>
#define MAX 1000010
using namespace std;
int a[MAX],b[MAX],c[MAX],d[MAX],e[MAX],k0,k1,k2,n;
long long int q[MAX];
int main()
{
	ios::sync_with_stdio(false);
	freopen("asm_grenade.in","r",stdin);
	//freopen("asm_grenade.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)cin>>b[i];
	for(int i=1;i<=n;i++)cin>>c[i];
	for(int i=1;i<=n;i++)cin>>d[i];
	for(int i=1;i<=n;i++)cin>>e[i];
	cin>>k0>>k1>>k2;
	int xa,xb,xc;
	for(int i=1;i<=n;i++)
	{
		xa=k0-a[i];
	    xb=k1-b[i];
		xc=k2+xa+xb;
		q[i]=xc+c[i]+d[i]+e[i];
	   }
		sort(q,q+n);
		cout<<q[n-1]+8;//莫名其妙的演草
		return 0;
}