def breakSum(n):
    memo = {}

    def best(value):
        if value == 0:
            return 0
        if value in memo:
            return memo[value]

        broken = best(value // 2) + best(value // 3) + best(value // 4)
        result = max(value, broken)
        memo[value] = result
        return result

    return best(n)