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

use proconio::marker::Chars;

fn main() {
    proconio::input! {
        n: u32,
        mut a: [i32;n],
        b: [i32;n],
    }
    let mut min_b = i32::MAX;
    let mut b = VecDeque::from_iter(b);
    for _ in 0..n {
        #[derive(PartialEq, Eq, PartialOrd, Ord)]
        struct Mons {
            level: i32,
            battle: i32,
            id: usize,
        }
        let mut bts = a
            .iter()
            .copied()
            .enumerate()
            .map(|(i, l)| Mons {
                level: l,
                battle: 0,
                id: i,
            })
            .collect::<BTreeSet<_>>();

        for b in b.iter() {
            let mut a = bts.pop_first().unwrap();
            a.level += b / 2;
            a.battle += 1;
            bts.insert(a);
        }

        min_b = std::cmp::min(min_b, bts.iter().map(|b| b.battle).max().unwrap());

        let temp = b.pop_front().unwrap();
        b.push_back(temp);
    }
    println!("{min_b}");
}