
    Given an initial investment amount, determine the optimal portfolio allocation strategy that maximizes potential returns by either keeping the investment amount whole or dividing it among four different investment vehicles with ratios of 1/2, 1/3, 1/4, and 1/5 respectively. The strategy should recursively evaluate all possible combinations of these allocation ratios to find the maximum achievable return value, considering that each subdivision can be further split using the same ratios or kept as is.
    

    
def get_max_sum(n):
    """
    Given an initial investment amount, determine the optimal portfolio allocation strategy that maximizes potential returns by either keeping the investment amount whole or dividing it among four different investment vehicles with ratios of 1/2, 1/3, 1/4, and 1/5 respectively. The strategy should recursively evaluate all possible combinations of these allocation ratios to find the maximum achievable return value, considering that each subdivision can be further split using the same ratios or kept as is.
    

    """
def get_max_sum(n):
    """
    Given an initial investment amount, determine the optimal portfolio allocation strategy that maximizes potential returns by either keeping the investment amount whole or dividing it among four different investment vehicles with ratios of 1/2, 1/3, 1/4, and 1/5 respectively. The strategy should recursively evaluate all possible combinations of these allocation ratios to find the maximum achievable return value, considering that each subdivision can be further split using the same ratios or kept as is.
    

    """
    res = list()
    res.append(0)
    res.append(1)
    i = 2
    while i < n + 1:
        res.append(max(i, res[int(i / 2)] + res[int(i / 3)] + res[int(i / 4)] + res[int(i / 5)]))
        i = i + 1
    return res[n]