using System;
using System.Collections.Generic;
using System.Linq;
namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const int MOD = 1000000007;
        private static List<int> take = new List<int>();
        static void Solve()
        {
            var o = ReadAndParseIntArr();
            var n = o[0];
            take.Add(o[1]);
            take.Add(o[2]);
            take.Add(o[3]);
            var l = new int[n];
            for(int i=0;i<n;++i)
            {
                l[i] = ReadAndParseInt();
            }
            var list = new List<int>(l);
            list.Sort();

            int[] assign = new int[n];
            assign[0] = 1;
            assign[1] = 1;
            assign[2] = 1;
            var test = Cost(1, assign, list);

            int ans = dfs(0, assign, list);

            Console.WriteLine(ans);

        }
        private static int dfs(int d, int[] assign, List<int> list)
        {
            if(d == assign.Length)
            {
                // けいさん
                return Cost(0, assign, list) + Cost(1, assign, list) + Cost(2, assign, list);
            }
            int min = int.MaxValue;
            assign[d] = 0;
            min = Math.Min(min, dfs(d+1, assign, list));
            assign[d] = 1;
            min = Math.Min(min, dfs(d + 1, assign, list));
            assign[d] = 2;
            min = Math.Min(min, dfs(d + 1, assign, list));
            return min;
        }
        private static List<int> usableTakes = new List<int>();
        private static List<int> workList = new List<int>();
        private const int kMaxMP = 100000;
        private static int Cost(int idx, int[] assign, List<int> list)
        {
            int t = take[idx];
            // 未使用なら失敗
            if(!assign.Any(p => p == idx)) { return kMaxMP; }
            // 完全一致ならmp 0
            for(int i=0;i<assign.Length;++i)
            {
                if( assign[i] != idx) { continue; }
                if( list[i] == t) { return 0; }
            }
            // 差が+-10なら返す
            int minDiff = int.MaxValue;
            int minIdx = -1;
            for(int i=0;i<assign.Length;++i)
            {
                if (assign[i] != idx) { continue; }
                int cost = Math.Abs(list[i] - t);
                if( cost < minDiff && cost <= 10)
                {
                    minDiff = cost;
                    minIdx = i;
                }
            }
            if( minIdx >= 0)
            {
                return minDiff;
            }

            // 足し合わせ
            usableTakes.Clear();
            for(int i=0;i<assign.Length;++i)
            {
                if (assign[i] != idx) { continue; }
                usableTakes.Add(list[i]);
            }
            // bitで羅列
            int minMP = kMaxMP;
            var max = pow(2, usableTakes.Count);
            for (int i = 1; i < max; ++i)
            {
                int len = 0;
                workList.Clear();
                for (int j = 0; j < usableTakes.Count; ++j)
                {
                    if ((i & (1 << j)) != 0)
                    {
                        workList.Add(usableTakes[j]);
                        len += usableTakes[j];
                    }
                }

                int mp = 10 * (workList.Count - 1);
                mp += Math.Abs(len - t);
                if( mp < minMP)
                {
                    minMP = mp;
                }
            }

            return minMP;
        }

        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }

        /// <summary>
        /// 指定した値以上の先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値以上の先頭のインデクス</returns>
        public static int LowerBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) < 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int LowerBound<T>(IReadOnlyList<T> arr, T value) where T : IComparable
        {
            return LowerBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }

        /// <summary>
        /// 指定した値より大きい先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値より大きい先頭のインデクス</returns>
        public static int UpperBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) <= 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int UpperBound<T>(IReadOnlyList<T> arr, T value)
        {
            return UpperBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }
        #endregion
    }
}

Measured memory_bytes: 15444