/**
 *    author:  tourist
 *    created: 28.11.2019 08:58:56       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename T, typename C>
class mcmf {
 public:
  static constexpr T eps = (T) 1e-9;

  struct edge {
    int from;
    int to;
    T c;
    T f;
    C cost;
  };

  vector<vector<int>> g;
  vector<edge> edges;
  vector<C> d;
  vector<int> q;
  vector<bool> in_queue;
  vector<int> pe;
  int n;
  int st, fin;
  T flow;
  C cost;

  mcmf(int _n, int _st, int _fin) : n(_n), st(_st), fin(_fin) {
    assert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);
    g.resize(n);
    d.resize(n);
    in_queue.resize(n);
    pe.resize(n);
    flow = 0;
    cost = 0;
  }

  void clear_flow() {
    for (const edge &e : edges) {
      e.f = 0;
    }
    flow = 0;
  }
   
  void add(int from, int to, T forward_cap, T backward_cap, C cost) {
    assert(0 <= from && from < n && 0 <= to && to < n);
    g[from].push_back((int) edges.size());
    edges.push_back({from, to, forward_cap, 0, cost});
    g[to].push_back((int) edges.size());
    edges.push_back({to, from, backward_cap, 0, -cost});
  }

  bool expath() {
    fill(d.begin(), d.end(), numeric_limits<C>::max());
    q.clear();
    q.push_back(st);
    d[st] = 0;
    in_queue[st] = true;
    int beg = 0;
    bool found = false;
    while (beg < (int) q.size()) {
      int i = q[beg++];
      if (i == fin) {
        found = true;
      }
      in_queue[i] = false;
      for (int id : g[i]) {
        const edge &e = edges[id];
        if (e.c - e.f > eps && d[i] + e.cost < d[e.to]) {
          d[e.to] = d[i] + e.cost;
          pe[e.to] = id;
          if (!in_queue[e.to]) {
            q.push_back(e.to);
            in_queue[e.to] = true;
          }
        }
      }
    }
    if (found) {
      T push = numeric_limits<T>::max();
      int v = fin;
      while (v != st) {
        const edge &e = edges[pe[v]];
        push = min(push, e.c - e.f);
        v = e.from;
      }
      v = fin;
      while (v != st) {
        edge &e = edges[pe[v]];
        e.f += push;
        edge &back = edges[pe[v] ^ 1];
        back.f -= push;
        v = e.from;
      }
      flow += push;
      cost += push * d[fin];
    }
    return found;
  }
   
  pair<T, C> max_flow_min_cost() {
    while (expath()) {}
    return {flow, cost};
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  mcmf<int, long long> g(2 * n + 6, 2 * n + 4, 2 * n + 5);
  vector<int> xr(n), yr(n), cr(n);
  for (int i = 0; i < n; i++) {
    cin >> xr[i] >> yr[i] >> cr[i];
  }
  vector<int> xb(n), yb(n), cb(n);
  for (int i = 0; i < n; i++) {
    cin >> xb[i] >> yb[i] >> cb[i];
  }
  for (int i = 0; i < n; i++) {
    g.add(g.st, i, cr[i], 0, 0);
    for (int mask = 0; mask < 4; mask++) {
      g.add(i, 2 * n + mask, cr[i], 0, ((mask & 1) ? 1 : -1) * xr[i] + ((mask & 2) ? 1 : -1) * yr[i]);
    }
  }
  for (int i = 0; i < n; i++) {
    g.add(n + i, g.fin, cb[i], 0, 0);
    for (int mask = 0; mask < 4; mask++) {
      g.add(2 * n + mask, n + i, cb[i], 0, ((mask & 1) ? -1 : 1) * xb[i] + ((mask & 2) ? -1 : 1) * yb[i]);
    }
  }
  cout << -g.max_flow_min_cost().second << '\n';
  return 0;
}


Measured memory_bytes: 1304