#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

use std::cmp::min;
use std::collections::BTreeMap;

fn main() {
    input! {
        n: usize,
        a: i64,
        b: i64,
        c: i64,
        l: [i64; n],
    }

    let f = |s: i64, v: i64| -> i64 {
        (v - (0..n)
            .map(|i| if s & (1 << i) != 0 { l[i] } else { 0 })
            .sum::<i64>())
        .abs()
    };

    let mut ans = i64::max_value();

    for sa in 0..(1 << n) {
        for sb in 0..(1 << n) {
            for sc in 0..(1 << n) {
                if sa & sb != 0 || sb & sc != 0 || sc & sa != 0 {
                    continue;
                }
                let cur = f(sa, a) + f(sb, b) + f(sc, c);
                ans = min(ans, cur);
            }
        }
    }

    println!("{}", ans);

    // let abc = [a, b, c];
    // let ans = rec(&l, &abc, &mut BTreeMap::new());
}

fn rec(l: &Vec<i64>, abc: &[i64], tbl: &mut BTreeMap<Vec<i64>, i64>) -> i64 {
    if let Some(ret) = tbl.get(l) {
        return *ret;
    }

    let mut ret = 1000000;

    for i in 0..l.len() {
        for j in 0..l.len() {
            if i == j {
                continue;
            }
            for k in 0..l.len() {
                if i == k || j == k {
                    continue;
                }

                let cur = (l[i] - abc[0]).abs() + (l[j] - abc[1]).abs() + (l[k] - abc[2]).abs();
                ret = std::cmp::min(ret, cur);
            }
        }
    }

    for i in 0..l.len() {
        for j in i + 1..l.len() {
            let mut nl = vec![l[i] + l[j]];

            for k in 0..l.len() {
                if k != i && k != j {
                    nl.push(l[k]);
                }
            }
            nl.sort();

            ret = std::cmp::min(ret, rec(&nl, abc, tbl) + 10);
        }
    }

    tbl.insert(l.clone(), ret);
    ret
}
