#![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 p = Permutation::new(n);
    let mut count = BTreeMap::new();
    loop {
        let mut temp = 0;
        for i in 0..n {
            temp += max(a[p.indexes[i]] - b[i], 0);
        }
        *count.entry(temp).or_insert(0) += 1;
        if !p.next_permutation() {
            break;
        }
    }

    println!("{}", count.values().rev().next().unwrap());
}

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()
}
struct Permutation {
    indexes: Vec<usize>,
}

impl Permutation {
    fn new(n: usize) -> Permutation {
        Permutation {
            indexes: (0..n).collect::<Vec<_>>(),
        }
    }

    fn next_permutation(&mut self) -> bool {
        if self.indexes.len() < 2 {
            return false;
        }

        let mut i = self.indexes.len() - 1;
        while i > 0 && self.indexes[i - 1] >= self.indexes[i] {
            i -= 1;
        }

        if i == 0 {
            return false;
        }

        let mut j = self.indexes.len() - 1;
        while j >= i && self.indexes[j] <= self.indexes[i - 1] {
            j -= 1;
        }

        self.indexes.swap(j, i - 1);
        self.indexes[i..].reverse();
        true
    }
}