





"""simple docstring"""


def SCREAMING_SNAKE_CASE_  (			snake_case  :   Dict						)->						Tuple:
       if not numbers:
              return 0

       if not isinstance(snake_case		,    (list, tuple)						) or not all(
           isinstance(snake_case		,    snake_case						) for number in numbers						):
              raise ValueError('numbers must be an iterable of integers'						)

       _lowerCamelCase             =   numbers[0]

       for i in range(1		,    len(snake_case						)						):
              # update the maximum and minimum subarray products
              _lowerCamelCase             =   numbers[i]
              if number < 0:
                     _lowerCamelCase             =   min_till_now, max_till_now
              _lowerCamelCase             =   max(snake_case		,    max_till_now * number						)
              _lowerCamelCase             =   min(snake_case		,    min_till_now * number						)

              # update the maximum product found till now
              _lowerCamelCase             =   max(snake_case		,    snake_case						)

       return max_prod












from __future__ import annotations

from fractions import Fraction




def 		lowerCAmelCase_ (						lowerCamelCase						,  lowerCamelCase ):
				return (
				    num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
				)




def 		lowerCAmelCase_ (						lowerCamelCase ):
				__magic_name__						:						List[str]										=[]
				__magic_name__						:						List[Any]										=11
				__magic_name__						:						Tuple										=int("""1""" + """0""" * digit_len )
				for num in range(lowerCamelCase						,  lowerCamelCase ):
								while den <= 99:
												if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
																if is_digit_cancelling(lowerCamelCase						,  lowerCamelCase ):
																				solutions.append(F"{num}/{den}" )
												den += 1
								num += 1
								__magic_name__						:						List[str]										=10
				return solutions




def 		lowerCAmelCase_ (						lowerCamelCase = 2 ):
				__magic_name__						:						str										=1.0
				for fraction in fraction_list(lowerCamelCase ):
								__magic_name__						:						int										=Fraction(lowerCamelCase )
								result *= frac.denominator / frac.numerator
				return int(lowerCamelCase )


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




