import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

V0,V1,V2,V3=map(int,readline().split())
inf=1<<60
ans=inf
for C in range(1,31):
    for B in range(1,C):
        for A in range(1,B):
            cnt=[inf]*31
            for a in range(31):
                for b in range(31):
                    for c in range(31):
                        if A*a+B*b+C*c>30:
                            break
                        cnt[A*a+B*b+C*c]=min(cnt[A*a+B*b+C*c],a+b+c)
            ans=min(ans,cnt[V0]+cnt[V1]+cnt[V2]+cnt[V3])
print(ans)