import java.io.PrintWriter
import java.util.*
import java.math.*
import java.lang.*


val pw = PrintWriter(System.out)
val MOD: Long = (1e+9 + 7).toLong()

class Dfs(val N: Int, val A: Int, val B: Int, val C: Int,
    val bamboos: List<Int>) {
    fun dfs(i: Int, a: Int, b: Int, c: Int): Int {
        if(i == N) {
            if(listOf(a, b, c).min()!! == 0) return 10000000
            else {
                val rtn = Math.abs(a-A) + Math.abs(b-B) + Math.abs(c-C) - 30
                return rtn
            }
        }
        else {
            val ret0 = dfs(i+1, a, b, c)
            val ret1 = dfs(i+1, a+bamboos[i], b, c) + 10
            val ret2 = dfs(i+1, a, b+bamboos[i], c) + 10
            val ret3 = dfs(i+1, a, b, c+bamboos[i]) + 10
            return listOf(ret0, ret1, ret2, ret3).min()!!
        }
    }
}

fun main(args: Array<String>) {
    val (n, a, b, c) = readListOfInt()
    val bamboos = mutableListOf<Int>()
    for(i in 0 until n) {
        bamboos.add(readInt())
    }
    println(Int.MAX_VALUE)
    val mp = Dfs(n, a, b, c, bamboos).dfs(0, 0, 0, 0)
    println(mp)
     

    pw.flush()
}

/****** Decrared Functions and Data Structures ******/
// IO
fun read() = readLine()!!
fun readInt() = read().toInt()
fun readLong() = read().toLong()
fun readDouble() = read().toDouble()
fun readListOfString() = read().split(" ")
fun readListOfInt() = readListOfString().map { it.toInt() }
fun readListOfLong() = readListOfString().map { it.toLong() }
fun readListOfDouble() = readListOfString().map { it.toDouble() }

fun Double.format(digits: Int) = String.format("%.${digits}f", this)

fun print(value: Any) { pw.print(value) }
fun println(value : Any) { pw.println(value) }

fun<T> permutations(src: List<T>): List<List<T>> {
    if(src.size == 1) return listOf(src)
    val perms = mutableListOf<List<T>>()
    val insertElement = src[0]
    permutations(src.drop(1)).forEach { perm ->
        for(i in 0..perm.size) {
            val newPerm = perm.toMutableList()
            newPerm.add(i, insertElement)
            perms.add(newPerm.toList())
        }
    }
    return perms
}

// return nCr, if you want nCr, please access v[n][r]
fun combination(n: Long): List<List<Long>> {
    val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()
    for(i in 0 until v.size) {
        v[i][0] = 1L
        v[i][i] = 1L
    }
    for(i in 0 until v.size) {
        for(j in 1 until i) {
            v[i][j] = (v[i-1][j-1] + v[i-1][j] % MOD)
        }
    }
    val rtn = v.map { it.toList() }.toList()
    return rtn 
}

fun gcd(a: Long, b: Long): Long = 
if(b != 0L) a else gcd(b, a % b)

fun lcm(a: Long, b: Long) = 
if(b==0L) a else gcd(b, a % b)

fun sumDigits(num_: Long): Long {
    var num = num_
    var rtn: Long = 0
    while(num != 0.toLong()) {
        val tmp = num % 10
        rtn += tmp
        num /= 10
    }
    return rtn
}

// Data Structures
class Stack<T>(private var st: MutableList<T> = mutableListOf<T>()) {
    fun isEmpty() = st.isEmpty()
    fun top(): T = st.last()
    fun push(e: T) { st.add(e) }
    fun pop() { st = st.dropLast(1).toMutableList() }
}

class Queue<T>(private var que: MutableList<T> = mutableListOf<T>()) {
    fun isEmpty() = que.isEmpty()
    fun top(): T = que.first()
    fun push(e: T) { que.add(e) }
    fun pop() { que = que.drop(1).toMutableList() }
}
