INF = 1 << 60

v = list(map(int, input().split()))

m = 30

ans = INF
for a in range(1, m + 1):
  for b in range(a + 1, m + 1):
    for c in range(b + 1, m + 1):
      dp = [INF for _ in range(m + 1)]
      dp[0] = 0
      for x in range(m):
        if dp[x] == INF:
          continue
        for y in [a, b, c]:
          if x + y <= m:
            dp[x + y] = min(dp[x + y], dp[x] + 1)

      if max(dp[x] for x in v) < INF:
        ans = min(ans, sum(dp[x] for x in v))

print(ans)