"""simple docstring"""


from itertools import combinations_with_replacement

def 						UpperCamelCase				(	_lowerCAmelCase   :							int = 100						):
    __a			      =						[*list(range(1				, 21						)						), 25]
    __a			      =						[2 * x for x in range(1				, 21						)] + [50]
    __a			      =						[3 * x for x in range(1				, 21						)]
    __a			      =						singles + doubles + triples + [0]

    __a			      =						0
    __a			      =						42
    __a			      =						42
    __a			      =						42
    __a			      =						42

    for double in doubles:
        for throwa, throwa in combinations_with_replacement(_lowerCAmelCase				, 2						):
            __a			      =						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)
