def breakSum(n):
    memo = {}

    def solve(x):
        if x == 0:
            return 0
        if x in memo:
            return memo[x]
        memo[x] = max(x, solve(x // 2) + solve(x // 3) + solve(x // 4))
        return memo[x]

    return solve(n)