#include<bits/stdc++.h>
using namespace std;

#define re register
#define rint re int
#define ll long long
#define rll re ll
#define db double
#define rdb re db
#define rch re char

template <typename T> inline T read()
{
	re T ans=0;rint f=0;rch ch=getchar();
	for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=1;
	for(;isdigit(ch);ch=getchar()) ans=ans*10+(ch&15);
	return f?-ans:ans;
}

const int maxn=5e2+10;
const int maxm=4e5+10;
const ll Inf=0x3f3f3f3f3f3f3f3f;

struct Node
{
	int to,next,val;
}e[maxm];
int head[maxn];
bool vis1[maxn];
bool vis2[maxn];
ll num1[maxn];
ll num2[maxn];
int bel1[maxn];
int bel2[maxn];
int pre[maxn];
ll mn[maxn];
int cnt,n;

inline void add(rint x,rint y,rint z)
{
	e[++cnt].to=y;
	e[cnt].next=head[x];
	e[cnt].val=z;
	head[x]=cnt;
}

inline void modify(rint x)
{
	for(rint tmp2=x,tmp1=pre[x];tmp2;tmp1=pre[tmp2])
		bel2[tmp2]=tmp1,swap(bel1[tmp1],tmp2);
}

inline void bfs(rint s)
{
	memset(vis1+1,0,n),memset(vis2+1,0,n),memset(mn+1,0x3f,n<<3);
	queue<int> q;q.push(s);
	while(1)
	{
		while(!q.empty())
		{
			rint x=q.front();q.pop();vis1[x]=1;
			for(rint i=head[x];i;i=e[i].next)
			{
				rint v=e[i].to;if(vis2[v]) continue;
				if(num1[x]+num2[v]-e[i].val<mn[v])
				{
					mn[v]=num1[x]+num2[v]-e[i].val,pre[v]=x;
					if(!mn[v])
					{
						vis2[v]=1;
						if(!bel2[v]) return modify(v);
						else q.push(bel2[v]);
					}
				}
			}
		}
		rll tmp=Inf;
		for(rint i=1;i<=n;i++) if(!vis2[i]) tmp=min(tmp,mn[i]);
		for(rint i=1;i<=n;i++)
		{
			if(vis1[i]) num1[i]-=tmp;
			if(vis2[i]) num2[i]+=tmp;
			else mn[i]-=tmp;
		}
		for(rint i=1;i<=n;i++)
			if(!vis2[i]&&!mn[i])
			{
				vis2[i]=1;
				if(!bel2[i]) return modify(i);
				else q.push(bel2[i]);
			}
	}
}
struct A{ll a; int p;}a[maxn];
bool cmp(A i,A j) {
	return i.a<j.a;
}
ll b[maxn],c[maxn];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%lld",&a[i].a);
	for(int i=1;i<=n;++i) scanf("%d",&a[i].p);
	for(int i=1;i<=n;++i) scanf("%lld",&b[i]);
	for(int i=1;i<=n;++i) scanf("%lld",&c[i]);
	sort(c+1,c+n+1);
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;++i) {
		int l=0; ll s=0;
		for(int j=1;j<=n;++j) {
			while(l<=n&&a[l+1].a<b[i]+c[j]) {
				++l; 
				s+=a[l].p;
			}
			add(i,j,s);
		}
	}
	memset(num1+1,0xc0,n<<3);
	for(rint x=1;x<=n;x++)
		for(rint i=head[x];i;i=e[i].next)
			num1[x]=max(num1[x],(ll)e[i].val);
	for(rint i=1;i<=n;i++) bfs(i);
	rll ans=0;
	for(rint i=1;i<=n;i++) ans+=num1[i]+num2[i];
	printf("%lld\n",ans);
//	for(rint i=1;i<=n;i++) printf("%d ",bel2[i]);
	return 0;
}