#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<set>
#include<map>
using namespace std;
typedef long long LL;
#define int long long
const int N = 1010 , inf = 1e16;
inline int read()
{
	register int x = 0 , f = 0; register char c = getchar();
	while(c < '0' || c > '9') f |= c == '-' , c = getchar();
	while(c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0' , c = getchar();
	return f ? -x : x;
}

int n , S , T , cnt = 1;
int head[N << 1] , f[N << 1] , pre[N << 1] , vis[N << 1];
LL dis[N << 1];
struct node{ int x , y , c; }p1[N] , p2[N];
struct edge{ int v , nex , c; LL val; }e[(N * (N + 2)) << 1];
inline void add(int u , int v , int c , int val)
{
	e[++cnt].v = v; e[cnt].nex = head[u]; e[cnt].c = c; e[cnt].val = val; head[u] = cnt;
	e[++cnt].v = u; e[cnt].nex = head[v]; e[cnt].c = 0; e[cnt].val = -val; head[v] = cnt;
}

queue<int> q;
bool spfa()
{
	for(int i = 1 ; i <= T ; ++i) dis[i] = -inf , pre[i] = 0 , f[i] = 0; dis[S] = 0; f[S] = inf; q.push(S);
	while(q.size())
	{
		int x = q.front(); q.pop(); vis[x] = 0;
		for(int i = head[x] , v; i ; i = e[i].nex)
		{
			v = e[i].v;
			if(e[i].c && dis[v] < dis[x] + e[i].val)
			{
				dis[v] = dis[x] + e[i].val; pre[v] = i; f[v] = min(f[x] , e[i].c);
				if(!vis[v]) vis[v] = 1 , q.push(v);
			}
		}
	}
	return dis[T] != -inf;
}

LL calc()
{
	LL cost = 0;
	while(spfa())
	{
		cost += (LL)f[T] * dis[T]; int t = T , i;
		do i = pre[t] , e[i].c -= f[T] , e[i^1].c += f[T] , t = e[i^1].v; while(t != S);
	}
	return cost;
}

inline int Dis(node a , node b) { return abs(a.x - b.x) + abs(a.y - b.y); }

signed main()
{
	n = read(); int t1 = n + n + 1 , t2 = t1 + 1 , t3 = t2 + 1 , t4 = t3 + 1; S = t4 + 1; T = S + 1;
	for(int i = 1 ; i <= n ; ++i) p1[i].x = read() , p1[i].y = read() , p1[i].c = read();
	for(int i = 1 ; i <= n ; ++i) p2[i].x = read() , p2[i].y = read() , p2[i].c = read();
	for(int i = 1 ; i <= n ; ++i)
	{
		add(S , i , p1[i].c , 0);
		add(i , t1 , inf , p1[i].x + p1[i].y);
		add(i , t2 , inf , p1[i].x - p1[i].y);
		add(i , t3 , inf , -p1[i].x + p1[i].y);
		add(i , t4 , inf , -p1[i].x - p1[i].y);
	}
	
	for(int i = 1 ; i <= n ; ++i)
	{
		add(i + n , T , p2[i].c , 0);
		add(t1 , i + n , inf , -p2[i].x - p2[i].y);
		add(t2 , i + n , inf , -p2[i].x + p2[i].y);
		add(t3 , i + n , inf , p2[i].x - p2[i].y);
		add(t4 , i + n , inf , p2[i].x + p2[i].y);
	}
	
	cout << calc() << '\n'; return 0;
}