#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
  for (int j = 0; j < ((int)(v).size()); ++j) i >> v[j];
  return i;
}
template <typename T>
string join(const vector<T>& v) {
  stringstream s;
  for (int i = 0; i < ((int)(v).size()); ++i) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T>
inline ostream& operator<<(ostream& o, const vector<T>& v) {
  if ((int)(v).size()) o << join(v);
  return o;
}
template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
  return i >> v.first >> v.second;
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2>& v) {
  return o << v.first << "," << v.second;
}
template <typename T>
inline long long int suma(const vector<T>& a) {
  long long int res(0);
  for (auto&& x : a) res += x;
  return res;
}
const double eps = 1e-10;
const long long int LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
int main() {
  int n;
  cin >> n;
  int a[3];
  cin >> a[0] >> a[1] >> a[2];
  int l[n];
  for (int i = 0; i < (n); ++i) {
    cin >> l[i];
  }
  int ans = 99999;
  for (int i = 0; i < (pow(4, n)); ++i) {
    int x[4] = {};
    int temp = 0;
    int ii = i;
    for (int j = 0; j < (n); ++j) {
      x[ii % 4] += l[j];
      if (x[ii % 4] > l[j] && ii % 4 <= 2) temp += 10;
      ii /= 4;
    }
    for (int j = 0; j < (3); ++j) {
      temp += abs(x[j] - a[j]);
    }
    ans = min(ans, temp);
  }
  cout << ans << endl;
  return 0;
}
