import itertools

def max_flights(a, b, c, d, e):
    from itertools import permutations
    combinations = [
        (0, 1, 2),  # A, B, C
        (1, 2, 3),  # B, C, D
        (2, 3, 4),  # C, D, E
        (3, 4, 0),  # D, E, A
        (4, 0, 1)   # E, A, B
    ]
    max_s = 0
    for perm in permutations(range(5)):
        aa, bb, cc, dd, ee = a, b, c, d, e
        s = 0
        for idx in perm:
            i, j, k = combinations[idx]
            current = [aa, bb, cc, dd, ee]
            x = min(current[i], current[j], current[k])
            s += x
            current[i] -= x
            current[j] -= x
            current[k] -= x
            aa, bb, cc, dd, ee = current
        if s > max_s:
            max_s = s
    return max_s

a, b, c, d, e = map(int, input().split())
print(max_flights(a, b, c, d, e))