// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

use std::cmp::min;
use std::collections::VecDeque;

const INF: isize = 1e12 as isize;


#[derive(Clone)]
struct FlowLink {
    src: usize,
    tgt: usize,
    cap: isize,
    cost: isize,
}

struct MinCostFlow {
    n: usize,
    links_from: Vec<Vec<usize>>,
    links: Vec<FlowLink>,
}

impl MinCostFlow {
    fn new(n: usize) -> MinCostFlow {
        MinCostFlow {
            n: n,
            links_from: vec![vec![]; n],
            links: vec![],
        }
    }
    fn add_link(&mut self, src: usize, tgt: usize, cap: isize, cost: isize) -> () {
        let i = self.links.len();
        self.links.push(FlowLink {
            src: src,
            tgt: tgt,
            cap: cap,
            cost: cost,
        });
        self.links.push(FlowLink {
            src: tgt,
            tgt: src,
            cap: 0,
            cost: -cost,
        });
        self.links_from[src].push(i);
        self.links_from[tgt].push(i + 1);
    }
    fn query(&mut self, s: usize, t: usize, quantity: isize) -> isize {
        let mut result: isize = 0;

        let mut remain = quantity;
        let mut predecessors = vec![0_usize; self.n];

        while remain > 0 {
//            println!("{}", remain);
            let mut distances: Vec<isize> = vec![INF; self.n];
            let mut updated: Vec<bool> = vec![false; self.n];
            distances[s] = 0;
            updated[s] = true;
            let mut deq: VecDeque<usize> = VecDeque::new();
            deq.push_back(s);

            while deq.len() > 0 {
                let v = deq.pop_front().unwrap();
                updated[v] = false;
                for li in self.links_from[v].iter() {
                    let link = &self.links[*li];
                    if link.cap == 0 { continue; }
                    let u = link.tgt;
                    let new_cost = distances[v] + link.cost;
                    if new_cost >= distances[u] { continue; }
                    distances[u] = new_cost;
                    predecessors[u] = *li;
                    if !updated[u] {
                        updated[u] = true;
                        deq.push_back(u);
                    }
                }
            }

            let mut min_cap = remain;
            let mut v = t;
            while v != s {
                let li = predecessors[v];
                min_cap = min(min_cap, self.links[li].cap);
                v = self.links[li].src;
            }
            v = t;
            while v != s {
                let li = predecessors[v];
                self.links[li].cap -= min_cap;
                self.links[li ^ 1].cap += min_cap;
                v = self.links[li].src;
            }
            remain -= min_cap;
            result -= min_cap * distances[t];
        };
        result
    }
}


fn main() {
    input! {
        n: usize,
        rrr: [(isize, isize, isize); n],
        bbb: [(isize, isize, isize); n],
    }

    let n2 = n * 2 + 6;
    let s = 0;
    let t = n * 2 + 1;
    let mut mcf = MinCostFlow::new(n2);
    let mut balls = 0;

    for (ri, (rx, ry, rc)) in (1..).zip(rrr) {
        balls += rc;
        mcf.add_link(s, ri, rc as isize, 0);
        mcf.add_link(ri, n2 - 4, rc, -(rx + ry));
        mcf.add_link(ri, n2 - 3, rc, -(-rx + ry));
        mcf.add_link(ri, n2 - 2, rc, -(rx - ry));
        mcf.add_link(ri, n2 - 1, rc, -(-rx - ry));
    }
    for (bi, (bx, by, bc)) in (n + 1..).zip(bbb) {
        mcf.add_link(bi, t, bc as isize, 0);
        mcf.add_link(n2 - 4, bi, bc, -(-bx - by));
        mcf.add_link(n2 - 3, bi, bc, -(bx - by));
        mcf.add_link(n2 - 2, bi, bc, -(-bx + by));
        mcf.add_link(n2 - 1, bi, bc, -(bx + by));
    }
    let res = mcf.query(s, t, balls);
    println!("{}", res);
}


Measured memory_bytes: 6396