






"""simple docstring"""

from itertools import combinations_with_replacement






def _lowerCAmelCase						(	__lowerCamelCase:int = 1_0_0 ):

						'''simple docstring'''






						__magic_name__      =  [*list(range(1			,    2_1 ) ), 2_5]
						__magic_name__      =  [2 * x for x in range(1			,    2_1 )] + [5_0]
						__magic_name__      =  [3 * x for x in range(1			,    2_1 )]
						__magic_name__      =  singles + doubles + triples + [0]

						__magic_name__      =  0
						__magic_name__      =  4_2
						__magic_name__      =  4_2
						__magic_name__      =  4_2
						__magic_name__      =  4_2

						for double in doubles:
												for throwa, throwa in combinations_with_replacement(_lowerCAmelCase			,    2 ):
																		__magic_name__      =  double + throwa + throwa
																		if checkout_total < limit:
																								num_checkouts += 1

						return num_checkouts


if __name__ == "__main__":
			print(f'''{solution() = }''')




"""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)
