PROGRAM ATCODER

implicit none
integer :: n, a(3), i, ans, j, k
integer, allocatable :: l(:), cost(:,:)

read(*,*) n, a(1), a(2), a(3)
allocate(l(n), cost(n,n))

do i = 1, n
	read(*,*) l(i)
end do

call hs(n,l)
call hs(3,a)

ans = 0

do i = 1, n
	if(a(i) == 0)cycle
	if(l(i) /= 0)then
		do j = 1, n
    		if(l(j) /= 0)then
    			if(l(i)+l(j) <= minval(a) .and. i /= j)then
        			l(i) = l(i) + l(j)
            		ans = ans + 10
            		l(j) = 0
        		end if
        	end if
    	end do
    end if
end do

do i = 1, 3
	do j = 1, n
    	if(l(j) == a(i)) then
        	l(j) = 0
            a(i) = 0
        end if
    end do
end do

do i = 1, 3
    cost = 0
	do j = 1, n
    	do k = 1, n
        	if(j == k) then
            	cost(j,k) = abs(l(j)-a(i))
            else
            	cost(j,k) = 10 + abs(l(j)+l(k)-a(i))
            end if
    	end do
    end do
	do j = 1, n
    	do k = 1, n
        	if (cost(j,k) == minval(cost))then
            	ans = ans + minval(cost)
            	cost(j,k) = 0
                l(j) = 0
                l(k) = 0
            end if
        end do
    end do
end do

write(*,'(i0)') ans

END PROGRAM ATCODER

subroutine hs(n,array)
  implicit none
  integer,intent(in) :: n
  integer,intent(inout) :: array(1:n)
  
  integer ::i,k,j,l
  integer :: t
  
  if(n <= 0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  if(n == 1)return
 
  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j <= k)
        if(j < k)then
           if(array(j) < array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
  enddo
 
  return
end subroutine hs

