    N, A, B, C = map(int, input().split())
    l = [int(input()) for _ in range(N)]

    def dfs(i, a, b, c, x):
        if i == N:
            return (abs(A - a) + abs(B - b) + abs(C - c) + 10 * (x - 3)) if a * b * c != 0 else 10 ** 9
        ret1 = dfs(i + 1, a, b, c, x)
        ret2 = dfs(i + 1, a + l[i], b, c, x + 1)
        ret3 = dfs(i + 1, a, b + l[i], c, x + 1)
        ret4 = dfs(i + 1, a, b, c + l[i], x + 1)
        return (min(ret1, ret2, ret3, ret4))
