from itertools import combinations


def c(v, a):
    dp = [float('inf')] * (v + max(a))
    dp[0] = 0
    for i in range(v):
        for b in a:
            dp[i + b] = min(dp[i + b], dp[i] + 1)
    return dp[v]


def solve():
    V = list(map(int, input().split()))

    mi = float('inf')
    for ijk in combinations(range(1, 31), 3):
        mi = min(mi, sum(c(V[l], ijk) for l in range(4)))
    print(mi)


if __name__ == '__main__':
    solve()