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 a = Vec::with_capacity(n);
    let mut b = Vec::with_capacity(n);
    for _ in 0..n {
        let mut temp = String::new();
        std::io::stdin().read_line(&mut temp).ok();
        let temp: Vec<isize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        a.push(temp[0]);
        b.push(temp[1]);
    }

    let mut lefts = vec![];
    let mut rights = vec![];
    for pat in 0..(1<<(n/2)) {
        let val = (0..n/2).map(|i| if ((pat >> i) & 1) == 1 { a[i] } else { -b[i] }).sum::<isize>();
        lefts.push(val);
    }
    for pat in 0..(1 << (n-n/2)) {
        let val = (0..(n-n/2)).map(|i| if ((pat >> i) & 1) == 1 { a[i+n/2] } else { -b[i+n/2] }).sum::<isize>();
        rights.push(val);
    }
    lefts.sort();
    rights.sort();
    let mut result = INF;
    for &v in lefts.iter() {
        let target = -v;
        let mut lower = 0usize;
        let mut upper = rights.len()-1;
        while upper > lower {
            let middle = (upper + lower) / 2;
            if rights[middle] >= target {
                upper = middle;
            } else {
                lower = middle+1;
            }
        }
        result = result.min((v + rights[upper]).abs());
        if upper > 0 {
            result = result.min((v + rights[upper-1]).abs());
        }
    }
    println!("{}", result);
}