n,A,B,C=map(int,input().split(' '))
l=[int(input()) for i in range(n)]
INF=10**9
def bfs(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
    else:
        ret0=bfs(cur+1,a,b,c)
        ret1=bfs(cur+1,a+l[cur],b,c)+10
        ret2=bfs(cur+1,a,b+l[cur],c)+10
        ret3=bfs(cur+1,a,b,c+l[cur])+10
        return min(ret0,ret1,ret2,ret3)
print(bfs(0,0,0,0))
    
