#!/usr/bin/env python3

import array
import itertools


INF = 10 ** 8
MAX_LEN = 30
NUM_BOARDS = 3


def compute_minimum(targets, boards):
    dp = array.array("L", (INF for _ in range(MAX_LEN + 1)))
    dp[0] = 0
    for board in boards:
        for i in range(board, MAX_LEN + 1):
            dp[i] = min(dp[i], dp[i - board] + 1)
    return sum(dp[target] for target in targets)


def solve(targets):
    gen = itertools.combinations(range(1, MAX_LEN + 1), 3)
    return min(compute_minimum(targets, boards) for boards in gen)


def main():
    targets = array.array("B", map(int, input().split()))
    print(solve(targets))


if __name__ == '__main__':
    main()