
    Given a delivery network with n possible routes, determine the most efficient delivery strategy by calculating the maximum efficiency score, where the score for any route n is either the route's direct efficiency value n, or the sum of efficiencies when splitting the route into four alternative paths (n/2, n/3, n/4, and n/5) based on different traffic and weather conditions. The optimization needs to recursively evaluate each possible route division to find the highest achievable efficiency score.
    

    
def get_max_sum(n):
    """
    Given a delivery network with n possible routes, determine the most efficient delivery strategy by calculating the maximum efficiency score, where the score for any route n is either the route's direct efficiency value n, or the sum of efficiencies when splitting the route into four alternative paths (n/2, n/3, n/4, and n/5) based on different traffic and weather conditions. The optimization needs to recursively evaluate each possible route division to find the highest achievable efficiency score.
    

    """
def get_max_sum(n):
    """
    Given a delivery network with n possible routes, determine the most efficient delivery strategy by calculating the maximum efficiency score, where the score for any route n is either the route's direct efficiency value n, or the sum of efficiencies when splitting the route into four alternative paths (n/2, n/3, n/4, and n/5) based on different traffic and weather conditions. The optimization needs to recursively evaluate each possible route division to find the highest achievable efficiency score.
    

    """
    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]