```python
def breakSum(n):
    """
    Finds the maximum sum by recursively breaking a number into n/2, n/3, and n/4.
    Uses memoization to store and reuse results of subproblems.
    """
    memo = {}

    def solve(num):
        if num == 0:
            return 0
        
        if num in memo:
            return memo[num]

        # Recursively find the sum of the broken parts.
        sum_of_parts = solve(num // 2) + solve(num // 3) + solve(num // 4)

        # The result is the maximum of the number itself or the sum of its parts.
        result = max(num, sum_of_parts)
        
        memo[num] = result
        return result

    return solve(n)
```