
"""simple docstring"""







def        __lowerCAmelCase							(_UpperCamelCase = 100			,    _UpperCamelCase = 100						):
	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()
"""simple docstring"""


from doctest import testmod
from math import sqrt

def 						UpperCamelCase				(	_lowerCAmelCase   :							int						):
    __a			      =						[]
    if num < 1:
        return facs
    facs.append(1						)
    if num == 1:
        return facs
    facs.append(_lowerCAmelCase						)
    for i in range(2				, int(sqrt(_lowerCAmelCase						)						) + 1						):
        if num % i == 0:  # If i is a factor of num
            facs.append(_lowerCAmelCase						)
            __a			      =						num // i  # num//i is the other factor of num
            if d != i:  # If d and i are distinct
                facs.append(_lowerCAmelCase						)  # we have found another factor
    facs.sort()
    return facs


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