#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// stream
//#include <istream>
#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << res / (1.0e9) << "s\n"; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream & os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

class PrimalDual {
	const int INF = INFLL;
	struct Edge { int to, cap, cost, rev; };

	int N;
	std::vector<std::vector<Edge>> g;
	std::vector<int> h, dist, preV, preE;

public:
	PrimalDual(int n) : N(n), g(n), h(n), dist(n), preV(n, -1), preE(n, -1) {}

	// fromからtoへの辺(容量cap, コストcost)を張る
	void addEdge(int from, int to, int cap, int cost) {
		g[from].emplace_back(Edge{ to, cap, cost, (int)g[to].size() });
		g[to].emplace_back(Edge{ from, 0, -cost, (int)g[from].size() - 1 });
	}

	// sからtに流量fの最小費用流を求める (流せなければ-1)
	int minCostFlow(int s, int t, int f) {
		int res = 0;
		h.assign(N, 0);
		using P = std::pair<int, int>;
		while (f > 0) {
			std::priority_queue<P, std::vector<P>, std::greater<P>> pq;
			dist.assign(N, INF);
			dist[s] = 0;
			pq.push(P(0, s));
			while (!pq.empty()) {
				P p = pq.top(); pq.pop();
				int v = p.second;
				if (dist[v] < p.first) continue;
				for (int i = 0; i < g[v].size(); ++i) {
					Edge& e = g[v][i];
					if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
						dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
						preV[e.to] = v;
						preE[e.to] = i;
						pq.push(P(dist[e.to], e.to));
					}
				}
			}
			if (dist[t] == INF) return -1;
			for (int v = 0; v < N; ++v) h[v] += dist[v];

			// s-t間の最短経路に流す
			int d = f;
			for (int v = t; v != s; v = preV[v]) {
				d = std::min(d, g[preV[v]][preE[v]].cap);
			}
			f -= d;
			res += d * h[t];
			for (int v = t; v != s; v = preV[v]) {
				Edge& e = g[preV[v]][preE[v]];
				e.cap -= d;
				g[v][e.rev].cap += d;
			}
		}
		return res;
	}
};

signed main() {
	INIT;

	VAR(int, n);
	PrimalDual pd(1 + n + 4 + n + 1);
	const int S0 = 0, S1 = S0 + 1, S2 = S1 + n, S3 = S2 + 4, S4 = S3 + n;
	const int S = S0, T = S4;

	int sum = 0;
	REP(i, n) {
		VAR(int, x, y, c);
		sum += c;

		pd.addEdge(S0, S1 + i, c, 0);
		pd.addEdge(S1 + i, S2 + 0, INFINT, +x + y + INFINT_LIM);
		pd.addEdge(S1 + i, S2 + 1, INFINT, +x - y + INFINT_LIM);
		pd.addEdge(S1 + i, S2 + 2, INFINT, -x + y + INFINT_LIM);
		pd.addEdge(S1 + i, S2 + 3, INFINT, -x - y + INFINT_LIM);
	}
	REP(i, n) {
		VAR(int, x, y, c);

		pd.addEdge(S2 + 0, S3 + i, INFINT, -x - y + INFINT_LIM);
		pd.addEdge(S2 + 1, S3 + i, INFINT, -x + y + INFINT_LIM);
		pd.addEdge(S2 + 2, S3 + i, INFINT, +x - y + INFINT_LIM);
		pd.addEdge(S2 + 3, S3 + i, INFINT, +x + y + INFINT_LIM);
		pd.addEdge(S3 + i, S4, c, 0);
	}

	int res = pd.minCostFlow(S, T, sum);
	res -= 2 * sum * INFINT_LIM;
	OUT(-res)BR;

	return 0;
}

Measured memory_bytes: 1512