
    Design a security verification system that determines the optimal security coverage for a transaction amount n by either processing it as a single verification step or splitting it into parallel verifications of n/2, n/3, n/4, and n/5 of the original amount, choosing whichever approach yields the highest security score. The system should recursively evaluate each split amount using the same logic, and return the maximum achievable security score for the entire transaction.
    

    
def get_max_sum(n):
    """
    Design a security verification system that determines the optimal security coverage for a transaction amount n by either processing it as a single verification step or splitting it into parallel verifications of n/2, n/3, n/4, and n/5 of the original amount, choosing whichever approach yields the highest security score. The system should recursively evaluate each split amount using the same logic, and return the maximum achievable security score for the entire transaction.
    

    """
def get_max_sum(n):
    """
    Design a security verification system that determines the optimal security coverage for a transaction amount n by either processing it as a single verification step or splitting it into parallel verifications of n/2, n/3, n/4, and n/5 of the original amount, choosing whichever approach yields the highest security score. The system should recursively evaluate each split amount using the same logic, and return the maximum achievable security score for the entire transaction.
    

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