def max_sum(tri, n):
    if n <= 0 or not tri:
        return 0
    dp = tri[-1][:]
    for i in range(n - 2, -1, -1):
        row = tri[i]
        for j in range(i + 1):
            dp[j] = row[j] + max(dp[j], dp[j + 1])
    return dp[0]