#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 100000009;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
  if (cur == N) {
    if (min(a, min(b, c)) > 0)
      return abs(a - A) + abs(b - B) + abs(c - C) - 30;
    else
      return INF;
  }
  int ret0 = dfs(cur + 1, a, b, c);
  int ret1 = dfs(cur + 1, a + l[cur], b, c) + 10;
  int ret2 = dfs(cur + 1, a, b + l[cur], c) + 10;
  int ret3 = dfs(cur + 1, a, b, c + l[cur]) + 10;
  return min(min(ret0, ret1), min(ret2, ret3));
}
int main() {
  cin >> N >> A >> B >> C;
  for (int i = 0; i > N; i++) {
    int a;
    cin >> a;
    l.push_back(a);
  }
  cout << dfs(0, 0, 0, 0) << endl;
  return 0;
}
