n,A,B,C =map(int, input().split())
l = [int(input()) for i in range(n)]
INF = 10 **9

def dfs(cur, a, b, c):
    if cur == n:
        return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a, b, c)>0 else INF

    x = dfs(cur+1, a, b, c)
    y = dfs(cur+1, a+l[cur], b, c)+10
    z = dfs(cur+1, a, b+l[cur], c)+10
    w = dfs(cur+1, a, b, c+l[cur])+10
    return min(x,y,z,w)

print(dfs(0,0,0,0))
