use std::collections::{BTreeSet, HashMap, VecDeque};

const INF: isize = 1isize << 60;

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut x = String::new();
    std::io::stdin().read_line(&mut x).ok();
    let x: Vec<isize> = x.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<isize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut pos = BTreeSet::new();
    for i in 0..n {
        pos.insert(x[i]);
        pos.insert(x[i]-a[i]);
        pos.insert(x[i]+a[i]);
    }
    let posmap = pos.iter().enumerate().map(|(i, &v)| (v, i)).collect::<HashMap<isize, usize>>();
    let mut paths = vec![vec![]; pos.len()];
    for i in 0..n {
        let lidx = *posmap.get(&(x[i]-a[i])).unwrap();
        let ridx = *posmap.get(&(x[i]+a[i])).unwrap();
        let cidx = *posmap.get(&x[i]).unwrap();
        paths[lidx].push(cidx);
        paths[ridx].push(cidx);
    }
    let mut result = vec![-INF; pos.len()];
    for &v in pos.iter().rev() {
        let idx = *posmap.get(&v).unwrap();
        if result[idx] > -INF { continue; }
        let mut deque = VecDeque::new();
        result[idx] = v;
        deque.push_back(idx);
        while let Some(idx) = deque.pop_front() {
            for &u in paths[idx].iter() {
                if result[u] > -INF { continue; }
                result[u] = v;
                deque.push_back(u);
            }
        }
    }
    for i in 0..n {
        let start = x[i];
        let end = result[*posmap.get(&x[i]).unwrap()];
        println!("{}", end - start);
    }
}