#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	int M = 1;
	for(int i = 0; i < N; ++i) M *= 3;
	int A,B,C; cin >> A >> B >> C;
	V<int> l(N);
	REP(i,N) cin >> l[i];
	int ans = INTINF;
	for(int i = 0; i < M; ++i){
		int n = i;
		V<int> bit(N);
		for(int j = 0; j < N; ++j) {
			bit[j] = n%3;
			n /= 3;
		}
		V<int> costA,costB,costC;
		for(int j = 0; j < N; ++j) {
			if(bit[j] == 0) costA.push_back(l[j]);
			if(bit[j] == 1) costB.push_back(l[j]);
			if(bit[j] == 2) costC.push_back(l[j]);
		}
		if(costA.empty() || costB.empty() || costC.empty()) continue;
	
		int a = costA.size(), ansA = INTINF;
		for(int j = 1; j < (1<<a); ++j){
			int sum = 0,d = 0;
			for(int k = 0; k < a; ++k) if(j & (1<<k)) sum += costA[k],d += 1;
			int cnt = abs(sum-A) + (d-1)*10;
			chmin(ansA,cnt);
		}

		int b = costB.size(), ansB = INTINF;
		for(int j = 1; j < (1<<b); ++j){
			int sum = 0,d = 0;
			for(int k = 0; k < b; ++k) if(j & (1<<k)) sum += costB[k],d += 1;
			int cnt = abs(sum-B) + (d-1)*10;
			chmin(ansB,cnt);
		}

		int c = costC.size(), ansC = INTINF;
		for(int j = 1; j < (1<<c); ++j){
			int sum = 0,d = 0;
			for(int k = 0; k < c; ++k) if(j & (1<<k)) sum += costC[k],d += 1;
			int cnt = abs(sum-C) + (d-1)*10;
			chmin(ansC,cnt);
		}

		// print(bit);
		// print(costA,ansA);
		// print(costB,ansB);
		// print(costC,ansC);
		// int tmp; cin >> tmp;

		chmin(ans,ansA+ansB+ansC);
	}
	cout << ans << endl;
	
	return 0;
}


Measured memory_bytes: 256