// use std::ops::{Index, IndexMut};
use std::cmp::{Ordering, min, max};
// use std::collections::{BinaryHeap, BTreeMap};
// use std::collections::btree_map::Entry::{Occupied, Vacant};
// use std::clone::Clone;

fn getline() -> String{
    let mut res = String::new();
    std::io::stdin().read_line(&mut res).ok();
    res
}

macro_rules! split {
    ($x: expr) => {
        ($x).trim().split(' ').collect()
    }
}

macro_rules! parse {
    ($x: expr) => {
        ($x).parse().unwrap()
    }
}

macro_rules! readl {
    ($t: ty) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            let mut iter = iv.into_iter();
            iter.next().unwrap().parse::<$t>().unwrap()
        }
    };
    ($( $t: ty),+ ) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            let mut iter = iv.into_iter();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*) 
        }
    };
}

macro_rules! rvec {
    ($x: expr) => {
        ($x).into_iter().map(|x| parse!(x)).collect()
    }
}

macro_rules! readlvec {
    ($t: ty) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            iv.into_iter().map(|x| x.parse().unwrap()).collect::<Vec<$t>>()
        }
    }
}

macro_rules! debug {
    ($x: expr) => {
        println!("{}: {}", stringify!($x), $x)
    }
}

fn printvec<T>(v: &Vec<T>) where T: std::fmt::Display {
    for (i,e) in v.into_iter().enumerate() {
        if i != 0 {
            print!(" ");
        }
        print!("{}", e);
    }
    println!("");
}

fn abs(x: i64) -> i64 {
    if x < 0 {
        -x
    } else {
        x
    }
}

const INF: i64 = 1e18 as i64;

fn main() {
    let n = readl!(usize);
    let mut iv = vec![(0,0); n];
    for i in 0..n {
        iv[i] = readl!(i64, i64);
    }
    let (a, b): (Vec<_>, Vec<_>) = iv.into_iter().unzip();
    
    if n == 1 {
        println!("{}", min(a[0], b[0]));
        return;
    }

    let mut re = Vec::<i64>::new();
    re.reserve(1<<(n-n/2));
    for mask in 0..(1<<(n-n/2)) {
        let mut sum = 0;
        for i in 0..n-n/2 {
            if (mask >> i) & 1 == 1 {
                sum += a[n/2+i];
            } else {
                sum -= b[n/2+i];
            }
        }
        re.push(sum);
    }
    re.sort();
    // printvec(&re);

    let mut ans = INF;
    for mask in 0..1<<n/2 {
        let mut sum = 0;
        for i in 0..n/2 {
            if (mask>>i)&1 == 1 {
                sum += a[i];
            } else {
                sum -= b[i];
            }
        }
        // debug!(sum);
        if re[0] >= -sum {
            ans = min(ans, abs(re[0] + sum));
        } else if re[re.len()-1] < -sum {
            ans = min(ans, abs(re[re.len()-1] + sum));
        } else {
            let mut l = 0;
            let mut r = re.len();
            while l+1 < r {
                let m = (l+r)/2;
                if -sum <= re[m] {
                    r = m;
                } else {
                    l = m;
                }
            }
            // debug!(r);
            ans = min(ans, abs(re[r] + sum));
            if r > 0 {
                ans = min(ans, abs(re[r-1] + sum));
            }
        }
    }
    
    println!("{}", ans);
}