import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 35;
enum N = 4;

int[] V;

void main() {
  auto dp = new int[][][][](LIM, LIM, LIM, LIM);
  foreach (a; 0 .. LIM) foreach (b; 0 .. LIM) foreach (c; 0 .. LIM) {
    auto DP = dp[a][b][c];
    DP[] = LIM;
    DP[0] = 0;
    foreach (n; 1 .. LIM) {
      foreach (x; [a, b, c]) {
        if (n >= x) {
          chmin(DP[n], DP[n - x] + 1);
        }
      }
    }
  }
  
  try {
    for (; ; ) {
      V = new int[N];
      foreach (i; 0 .. N) {
        V[i] = readInt();
      }
      int ans = LIM;
      foreach (a; 0 .. LIM) foreach (b; 0 .. LIM) foreach (c; 0 .. LIM) {
        int score;
        foreach (i; 0 .. N) {
          score += dp[a][b][c][V[i]];
        }
        chmin(ans, score);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}