

def 							__SCREAMING_SNAKE_CASE							( lowerCAmelCase:     int = 100     ,					lowerCAmelCase:     int = 100       )      ->				int:
				return max(
				    sum(int(lowerCAmelCase       ) for x in str(base**power       )       )
				    for base in range(lowerCAmelCase       )
				    for power in range(lowerCAmelCase       )       )


# Tests
if __name__ == "__main__":
					import doctest

					doctest.testmod()










from doctest import testmod
from math import sqrt
def      lowerCamelCase					(						a_	)	->			list:
							lowerCAmelCase_										=     []
							if num < 1:
														return facs
							facs.append(1	)
							if num == 1:
														return facs
							facs.append(a_	)
							for i in range(2 ,						int(sqrt(a_	)	) + 1	):
														if num % i == 0:  # If i is a factor of num
																					facs.append(a_	)
																					lowerCAmelCase_										=     num // i  # num//i is the other factor of num
																					if d != i:  # If d and i are distinct
																												facs.append(a_	)  # we have found another factor
							facs.sort()
							return facs


if __name__ == "__main__":
		testmod(name="""factors_of_a_number""", verbose=True)



