import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;



void main() {
    int n, a, b, c;
    scan(n, a, b, c);
    auto l = readArrByLines!(int)(n);

    // idx は今見ている竹の番号、 gc は合成に使った竹の本数
    int dfs(int idx, int la, int lb, int lc, int gc) {
        if (idx == n) {
            if (la == 0 || lb == 0 || lc == 0) {
                return inf3;
            }
            else {
                return abs(la - a) + abs(lb - b) + abs(lc - c) + 10 * (gc - 3);
            }
        }
        int res = inf3;
        // idx番目の竹を A のための合成に使う場合
        res = min(res, dfs(idx + 1, la + l[idx], lb, lc, gc + 1));
        // idx番目の竹を B のための合成に使う場合
        res = min(res, dfs(idx + 1, la, lb + l[idx], lc, gc + 1));
        // idx番目の竹を C のための合成に使う場合
        res = min(res, dfs(idx + 1, la, lb, lc + l[idx], gc + 1));
        // idx番目の竹は使わない場合
        res = min(res, dfs(idx + 1, la, lb, lc, gc));
        return res;
    }

    auto ans = dfs(0, 0, 0, 0, 0);

    writeln(ans);
}








int[][] readGraph(int n, int m, bool isUndirected = true, bool is1indexed = true) {
    auto adj = new int[][](n, 0);

    foreach (i ; 0 .. m) {
        int u, v;
        scan(u, v);
        if (is1indexed) {
            u--, v--;
        }
        adj[u] ~= v;
        if (isUndirected) {
            adj[v] ~= u;
        }
    }

    return adj;
}

alias Edge = Tuple!(int, "to", int, "cost");

Edge[][] readWeightedGraph(int n, int m, bool isUndirected = true, bool is1indexed = true) {
    auto adj = new Edge[][](n, 0);

    foreach (i ; 0 .. m) {
        int u, v, c;
        scan(u, v, c);
        if (is1indexed) {
            u--, v--;
        }
        adj[u] ~= Edge(v, c);
        if (isUndirected) {
            adj[v] ~= Edge(u, c);
        }
    }

    return adj;
}

void yes(bool b) {writeln(b ? "Yes" : "No");}
void YES(bool b) {writeln(b ? "YES" : "NO");}
T[] readArr(T)() {return readln.split.to!(T[]);}
T[] readArrByLines(T)(int n) {return iota(n).map!(i => readln.chomp.to!T).array;}

void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
