#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 2e3 + 10;

typedef pair<ll,int>    ii;

struct Edge {
    int v, c;
    ll  cost;

    Edge(int _v,int _c,ll  _cost) : v(_v), c(_c), cost(_cost)   {}
};

vector<int>  g[N];
vector<Edge> E;

void addEdge(int u,int v,int c,ll cost) {
    g[u].pb(sz(E));     E.pb(v,c, cost);
    g[v].pb(sz(E));     E.pb(u,0,-cost);
}

int S, T;
int p[N];
ll  d[N];

bool inc()  {
    for(int i = 0 ; i <= T ; ++i)
        d[i] = 1e18,
        p[i] = -1;

    d[S] = 0;
    p[S] = 1e9;

    vector<bool> inq(T + 1,0);
    queue<int>   qu;

    qu.push(S);

    while (qu.size())   {
        int u = qu.front(); qu.pop();
        inq[u] = 0;

        for(int i : g[u])   {
            int v = E[i].v;
            int C = E[i].cost;

            if (d[v] > d[u] + C && E[i].c > 0)  {
                d[v] = d[u] + C;
                p[v] = i;
                if(!inq[v]) {
                    inq[v] = 1;
                    qu.push(v);
                }
            }
        }
    }
    return  p[T] >= 0;
}
ll  MCMF()  {
    static int Flow = 0;
    static ll  Cost = 0;

    while (inc())   {
        int F = 1e9;
        for(int u = T ; u != S ;)   {
            int i = p[u];
            F = min(E[i].c,F);
            u = E[i ^ 1].v;
        }
        for(int u = T ; u != S ;)   {
            int i = p[u];
            E[i].c -= F;    i ^= 1;
            E[i].c += F;    u = E[i].v;
        }

        Flow += F;
        Cost += d[T] * F;
    }
    return  Cost;
}

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;

    S = 0;
    T = 5 + n +n;

    int tot = 4;

    for(int i = 0 ; i < n ; ++i)    {
        int x;  cin >> x;
        int y;  cin >> y;
        int c;  cin >> c;

        addEdge(S,++tot,c,0);

        for(int j = 0 ; j < 4 ; ++j)    {
            ll  C = 0;
            if (j & 1)  C -= x;
            else        C += x;
            if (j & 2)  C -= y;
            else        C += y;

            addEdge(tot,j + 1,c,C);
        }
    }
    for(int i = 0 ; i < n ; ++i)    {
        int x;  cin >> x;
        int y;  cin >> y;
        int c;  cin >> c;

        addEdge(++tot,T,c,0);

        for(int j = 0 ; j < 4 ; ++j)    {
            ll  C = 0;
            if (j & 1)  C += x;
            else        C -= x;
            if (j & 2)  C += y;
            else        C -= y;

            addEdge(j + 1,tot,c,C);
        }
    }
    cout << -MCMF() << endl;
}