def get_max_sum(n):
    memo = {}

    def f(x):
        if x == 0:
            return 0
        if x in memo:
            return memo[x]
        val = f(x // 2) + f(x // 3) + f(x // 4) + f(x // 5)
        memo[x] = val if val > x else x
        return memo[x]

    return f(n)