#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 2010
#define S 0
#define T 2001
#define red(x) (x)
#define blue(x) (n+(x))
#define id(x) (2002+(x))
#define int long long
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
    int x=0,f=1;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x*f;
}
int n,p[N],d[N],q[N],pre[N],t=-1,ans;
bool flag[N];
struct data{int x,y,c,v[4];
}a[N],b[N];
struct data2{int to,nxt,cap,flow,cost;
}edge[N<<5];
void addedge(int x,int y,int z,int cost)
{
    t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].cap=z,edge[t].flow=0,edge[t].cost=cost,p[x]=t;
    t++;edge[t].to=x,edge[t].nxt=p[y],edge[t].cap=0,edge[t].flow=0,edge[t].cost=-cost,p[y]=t;
}
int inc(int &x){x++;if (x>2007) x-=2007;return x;}
bool spfa()
{
    memset(d,60,sizeof(d));d[S]=0;
    memset(flag,0,sizeof(flag));
    int head=0,tail=1;q[1]=S;
    do
    {
        int x=q[inc(head)];flag[x]=0;
        for (int i=p[x];~i;i=edge[i].nxt)
        if (edge[i].flow<edge[i].cap&&d[x]+edge[i].cost<d[edge[i].to])
        {
            d[edge[i].to]=d[x]+edge[i].cost;
            pre[edge[i].to]=i;
            if (!flag[edge[i].to]) q[inc(tail)]=edge[i].to,flag[edge[i].to]=1;
        }
    }while (head!=tail);
    return d[T]<10000000000000000ll;
}
void ekspfa()
{
    while (spfa())
    {
        int v=n;
        for (int i=T;i!=S;i=edge[pre[i]^1].to)
        v=min(v,edge[pre[i]].cap-edge[pre[i]].flow);
        for (int i=T;i!=S;i=edge[pre[i]^1].to)
        edge[pre[i]].flow+=v,edge[pre[i]^1].flow-=v,ans+=v*edge[pre[i]].cost;
    }
}
signed main()
{
    n=read();memset(p,255,sizeof(p));
    for (int i=1;i<=n;i++)
    {
        a[i].x=read(),a[i].y=read(),a[i].c=read();
        a[i].v[0]=a[i].x+a[i].y;
        a[i].v[1]=a[i].x-a[i].y;
        a[i].v[2]=-a[i].x+a[i].y;
        a[i].v[3]=-a[i].x-a[i].y;
    }
    for (int i=1;i<=n;i++)
    {
        b[i].x=read(),b[i].y=read(),b[i].c=read();
        b[i].v[0]=-b[i].x-b[i].y;
        b[i].v[1]=-b[i].x+b[i].y;
        b[i].v[2]=b[i].x-b[i].y;
        b[i].v[3]=b[i].x+b[i].y;
    }
    for (int i=1;i<=n;i++)
    {
        addedge(S,red(i),a[i].c,0),addedge(blue(i),T,b[i].c,0);
        for (int j=0;j<4;j++)
        addedge(red(i),id(j),a[i].c,-a[i].v[j]),addedge(id(j),blue(i),b[i].c,-b[i].v[j]);
    }
    ekspfa();
    cout<<-ans;
    return 0;
    //NOTICE LONG LONG!!!!!
}