#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdio>
#define rep(i,x,y) for(int i=x; i<=y; ++i)

using namespace std;
const int N=2050,INF=1000000000;
typedef long long LL;
bool vis[N];
int n,h[N],cnt,q[10000000],from[N],s,t,head,tail;
LL ans,dis[N];
struct edge{int v,f,n; LL c;} e[N*20];

int getint()
{
	char ch;
	while(!isdigit(ch=getchar()));
	int x=ch-48;
	while(isdigit(ch=getchar())) x=x*10+ch-48;
	return x;
}

void addedge(int u,int v,int f,int c)
{
	e[cnt]=(edge){v,f,h[u],c},h[u]=cnt++;
	e[cnt]=(edge){u,0,h[v],-c},h[v]=cnt++;
}

bool spfa()
{
    rep(i,1,t) dis[i]=-1000000000000000ll,from[i]=-1;
   q[dis[s]=head=tail=0]=s,vis[s]=1;
    while(head<=tail)
    {
        int u=q[head++];
        for(int i=h[u],v; i!=-1; i=e[i].n)
            if(e[i].f>0 && dis[v=e[i].v]<dis[u]+e[i].c)
                if(dis[v]=dis[u]+e[i].c,from[v]=i,!vis[v])
                    vis[q[++tail]=v]=1;
        vis[u]=0;
    }
    return dis[t]!=-1000000000000000ll;
}

void mcf()
{
    int i=from[t],x=INF;
    while(i!=-1)
    {
        x=min(x,e[i].f);
        i=from[e[i^1].v];
    }
    i=from[t];
    ans+=x*dis[t];
    while(i!=-1)
    {
        e[i].f-=x,e[i^1].f+=x;
        i=from[e[i^1].v];
    }
}
 

int main()
{
	n=getint();
	memset(h,-1,sizeof(h));
	s=n*2+8+1,t=s+1;
	rep(i,1,n)
	{
		int x=getint(),y=getint(),c=getint();
		addedge(s,i,c,0);
		addedge(i,2*n+1,INF,x+y);
		addedge(i,2*n+2,INF,x-y);
		addedge(i,2*n+3,INF,-x+y);
		addedge(i,2*n+4,INF,-x-y);
	}
	
	rep(i,1,n)
	{
		int x=getint(),y=getint(),c=getint();
		addedge(i+n,t,c,0);
		addedge(2*n+5,i+n,INF,x+y);
		addedge(2*n+6,i+n,INF,x-y);
		addedge(2*n+7,i+n,INF,-x+y);
		addedge(2*n+8,i+n,INF,-x-y);
	}

	addedge(2*n+1,2*n+8,INF,0);
	addedge(2*n+2,2*n+7,INF,0);
	addedge(2*n+3,2*n+6,INF,0);
	addedge(2*n+4,2*n+5,INF,0);
	
	while(spfa())
		mcf();
	printf("%lld\n",ans);
	return 0;
}