Powers can grow into huge numbers very quickly, but sometimes the interesting part is the sum of their digits. Write a function max_powerful_digit_sum that checks values of a^b where both a and b are less than n. Find the largest digit sum among them. Return that maximum.

def max_powerful_digit_sum(n: int) -> int: