import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.NoSuchElementException;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte(){
        if(ptr < buflen){
            return true;
        }else{
            ptr = 0;
            try{
                buflen = in.read(buffer);
            }catch(IOException e){
                e.printStackTrace();
            }
            if(buflen <=0){
                return false;
            }
        }
        return true;
    }

    private int readByte(){
        if(hasNextByte())return buffer[ptr++];
        else return -1;
    }

    private static boolean isPrintableChar(int c){
        return 33<=c && c<=126;
    }
    public boolean hasNext(){
        while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;
        return hasNextByte();
    }

    public String next(){
        if(!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong(){
        if(!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        if(b < '0' || '9' < b){
            throw new NumberFormatException();
        }
        while(true){
            if('0' <= b && b<='9'){
                n*=10;
                n+=b-'0';
            }else if(b==-1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt(){
        long nl = nextLong();
        if(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDoutble(){return Double.parseDouble(next());}
}
public class Main{
    static int n;
    static int[] abc;
    static List<LinkedList<Integer>> list;
    static int[] l;
    static int min;
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        n = fs.nextInt();
        abc = new int[3];
        for(int i=0;i<3;i++)abc[i] = fs.nextInt();
        l = new int[n];
        list = new ArrayList<>();
        for(int i=0;i<3;i++)list.add(new LinkedList<>());
        for(int i=0;i<n;i++)l[i] = fs.nextInt();
        min = Integer.MAX_VALUE;
        dfs(0);
        System.out.println(min);
    }

    public static void dfs(int count){
        if(count == n){
            //a,b,cにつかう竹の集合のうちどれか一つのサイズが0ならリターン
            if(list.get(0).size()*list.get(1).size()*list.get(2).size()==0)return;
            int[] sum = new int[3];
            int[] mp = new int[3];
            for(int i=0;i<3;i++){
                for(Integer j : list.get(i)){
                    sum[i]+=j;
                    mp[i]+=10;
                }
                //自分自身を加算するときも10加算しているのでその分を引く
                mp[i]-=10;
                mp[i]+=Math.abs(sum[i]-abc[i]);
            }
            min = Math.min(min,mp[0]+mp[1]+mp[2]);
            return;
        }else{
            for(int i=0;i<4;i++){
                if(i<3){
                    list.get(i).add(l[count]);
                    dfs(count+1);
                    list.get(i).removeLast();
                }else{
                    dfs(count+1);
                }
            }
        }
    }
}