#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

const int MAXN=103;

struct team
{
	int p,r,d;
}a[MAXN];

int n,m,ans,i,j,k,dian=0,K;
bool used[MAXN];

void dfs(int dep,int now,int tim)
{
	++dian;
	if (dian>20000000 && ans!=1000000) return;
	if (now>=ans) return;
	if (dep==n+1)
	{
		ans=now;
		return;
	}
	int ti;
	for (int i=1;i<=n;i++)
		if (!used[i])
		{
			used[i]=true;
			ti=max(tim,a[i].r)+a[i].p;
			dfs(dep+1,max(now,ti-a[i].d),ti);
			used[i]=false;
		}
}

inline int cmp(const void *p,const void *q)
{
	return *((int *)p)-*((int *)q);
}

int main()
{
	freopen("preparation.in","r",stdin);
	freopen("preparation.out","w",stdout);
	for (;;)
	{
		scanf("%d",&n);
		if (n==0) break;
		for (i=1;i<=n;i++)
			scanf("%d",&a[i].p);
		for (i=1;i<=n;i++)
			scanf("%d",&a[i].r);
		for (i=1;i<=n;i++)
			scanf("%d",&a[i].d);
		qsort(a+1,n,sizeof(team),cmp);
		memset(used,false,sizeof(used));
		ans=1000000;
		dfs(1,0,0);
		printf("%d\n",ans);
	}
	return 0;
}