N,A,B,C = map(int,input().split())
l = list(int(input())for i in range(N))
ans = float('inf')

def dfs(x,a,b,c):
    if x == N:
        return (abs(a-A) + abs(b-B) + abs(c-C) -30) if min(a,b,c)> 0 else float('inf')
    ret0 = dfs(x+1,a,b,c)
    ret1 = dfs(x+1,a+l[x],b,c)+10
    ret2 = dfs(x+1,a,b+l[x],c)+10
    ret3 = dfs(x+1,a,b,c+l[x])+10
    return min(ret0,ret1,ret2,ret3)

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