def breakSum(n):
    if n <= 1:
        return n
    memo = {}
    def helper(n):
        if n in memo:
            return memo[n]
        if n <= 1:
            return n
        result = max(n, helper(n//2) + helper(n//3) + helper(n//4))
        memo[n] = result
        return result
    return helper(n)