#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;

const int N = 2048; typedef long long ll;

int bz[N],st[N],pre[N]; queue < int > q;
int n,tot,S,T,V1,V2,V3,V4; ll ans,dis[N];
struct EDGE{ int to,next,flow,cost; } g[N * 50];

int min(int x,int y) { return x < y ? x : y; }

void add(int u,int v,int w,int x)
{ g[++tot] = (EDGE){ v,st[u],w,x }, st[u] = tot; }

void add_edge(int u,int v,int w,int x) { add(u,v,w,x), add(v,u,0,-x); }

int spfa()
{
	memset(bz,0,sizeof bz),
	memset(pre,0,sizeof pre),
	memset(dis,-0x3f,sizeof dis);
	
	while(q.size()) q.pop();
	q.push(S), dis[S] = 0, bz[pre[S] = S] = 1;
	
	for(int x;q.size();bz[x] = 0)
	{
		x = q.front(), q.pop();
		for(int i = st[x];i;i = g[i].next)
			if(g[i].flow && dis[x] + g[i].cost > dis[g[i].to])
				!bz[g[i].to] && (q.push(g[i].to), bz[g[i].to] = 1),
				dis[g[i].to] = dis[x] + g[i].cost, pre[g[i].to] = i;
	}
	
	return pre[T];
}

void update()
{
	int flow = 0x3f3f3f3f; ll cost = 0ll;
	for(int i = T;i != S;i = g[pre[i] ^ 1].to)
		flow = min(flow,g[pre[i]].flow), cost += g[pre[i]].cost;
	ans += cost * flow;
	for(int i = T;i != S;i = g[pre[i] ^ 1].to)
		g[pre[i]].flow -= flow, g[pre[i] ^ 1].flow += flow;
}

int main()
{
	scanf("%d",&n), S = n * 2 + 1, T = S + 1, tot = 1,
	V1 = T + 1, V2 = V1 + 1, V3 = V2 + 1, V4 = V3 + 1;
	
	for(int i = 1,x,y,z;i <= n; ++ i)
		scanf("%d%d%d",&x,&y,&z), add_edge(S,i,z,0),
		add_edge(i,V1,z,x + y), add_edge(i,V2,z,x - y),
		add_edge(i,V3,z,- x + y), add_edge(i,V4,z,- x - y);
	
	for(int i = 1,x,y,z;i <= n; ++ i)
		scanf("%d%d%d",&x,&y,&z), add_edge(i + n,T,z,0),
		add_edge(V4,i + n,z,x + y), add_edge(V3,i + n,z,x - y),
		add_edge(V2,i + n,z,- x + y), add_edge(V1,i + n,z,- x - y);
	
	for(ans = 0ll;spfa();) update();
	printf("%lld\n",ans);
	
	return 0;
}