




from functools import lru_cache




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int				)  ->							set:
    UpperCAmelCase_										=					2
    UpperCAmelCase_										=					set()
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.add(__UpperCamelCase				)
    if n > 1:
        factors.add(__UpperCamelCase				)
    return factors




@lru_cache
def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int				)  ->							int:
    return len(unique_prime_factors(__UpperCamelCase				)				)




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						list				)  ->							bool:
    return len(set(__UpperCamelCase				)				) in (0, 1)




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int				)  ->							list:
    UpperCAmelCase_										=					2

    while True:
        # Increment each value of a generated range
        UpperCAmelCase_										=					[base + i for i in range(__UpperCamelCase				)]

        # Run elements through out unique_prime_factors function
        # Append our target number to the end.
        UpperCAmelCase_										=					[upf_len(__UpperCamelCase				) for x in group]
        checker.append(__UpperCamelCase				)

        # If all numbers in the list are equal, return the group variable.
        if equality(__UpperCamelCase				):
            return group

        # Increment our base variable by 1
        base += 1




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int = 4				)  ->							int:
    UpperCAmelCase_										=					run(__UpperCamelCase				)
    return results[0] if len(__UpperCamelCase				) else None


if __name__ == "__main__":
 print(solution())











from __future__ import annotations

from fractions import Fraction




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int	,					__UpperCamelCase      :						int				)  ->							bool:
    return (
        num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
    )




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int				)  ->							list[str]:
    UpperCAmelCase_										=					[]
    UpperCAmelCase_										=					11
    UpperCAmelCase_										=					int('''1''' + '''0''' * digit_len				)
    for num in range(__UpperCamelCase	,					__UpperCamelCase				):
        while den <= 99:
            if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
                if is_digit_cancelling(__UpperCamelCase	,					__UpperCamelCase				):
                    solutions.append(f'{num}/{den}'				)
            den += 1
        num += 1
        UpperCAmelCase_										=					10
    return solutions




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int = 2				)  ->							int:
    UpperCAmelCase_										=					1.0
    for fraction in fraction_list(__UpperCamelCase				):
        UpperCAmelCase_										=					Fraction(__UpperCamelCase				)
        result *= frac.denominator / frac.numerator
    return int(__UpperCamelCase				)


if __name__ == "__main__":
 print(solution())





