#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
use std::ops::Bound::*;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let n = read::<usize>();
    let a = read_vec::<i64>();
    let b = read_vec::<i64>();
    let mut pairs = vec![];
    for i in 0..n {
        pairs.push((a[i], b[i]));
    }
    pairs.sort();

    let criterion = |mid: i64| {
        pairs
            .iter()
            .map(|&(anum, bnum)| (anum - mid).abs() * bnum)
            .sum::<i64>()
    };
    let md = ternary_search(-1000001, 1000001, criterion);

    if criterion(md) < criterion(md + 1) {
        println!("{} {}", md, criterion(md));
    } else {
        println!("{} {}", md + 1, criterion(md + 1));
    }
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn ternary_search<F>(lb: i64, ub: i64, criterion: F) -> i64
where
    F: Fn(i64) -> i64,
{
    let mut lb = lb;
    let mut ub = ub;
    let mid = (lb + ub) / 2;
    let mut convex_upward = false;
    if criterion(mid) > (criterion(lb) + criterion(ub - 1)) / 2 {
        convex_upward = true;
    }
    while ub - lb > 2 {
        let mid1 = (ub + lb * 2) / 3;
        let mid2 = (ub * 2 + lb) / 3;
        if convex_upward {
            if criterion(mid1) < criterion(mid2) {
                lb = mid1;
            } else {
                ub = mid2;
            }
        } else {
            if criterion(mid1) > criterion(mid2) {
                lb = mid1;
            } else {
                ub = mid2;
            }
        }
    }
    (lb + ub) / 2
}