#include <iostream>
#include <algorithm>
#define INF 100000000

using namespace std;

int N, A, B, C;
int l[8];


int dfs(int n, int a, int b, int c) {
    if (n == 0) {
        if (a == 0 || b == 0 || c == 0) {
            return INF;
        } else {
            return abs(a - A) + abs(b - B) + abs(c - C) - 30;
        }
    }

    int l = l[n - 1];
    int ret0 = dfs(n - 1, a, b, c);
    int ret1 = dfs(n - 1, a + l, b, c) + 10;
    int ret2 = dfs(n - 1, a, b + l, c) + 10;
    int ret3 = dfs(n - 1, a, b, c + l) + 10; 

    return min({ret0, ret1, ret2, ret3});
}

int main() {
    cin >> N >> A >> B >> C;
    for(int i = 0; i < N; i++) cin >> l[i];

    cout << dfs(N, 0, 0, 0) << endl;

    return 0;
}
