




from __future__ import annotations

def     _SCREAMING_SNAKE_CASE    (							lowercase			: list[float]  ):


      '''simple docstring'''



      if len(lowercase  ) < 2:
            raise ValueError('Monogons and Digons are not polygons in the Euclidean space'  )
      if any(i <= 0 for i in nums  ):
            raise ValueError('All values must be greater than 0'  )
      lowerCamelCase_	  =					nums.copy()
      copy_nums.sort()
      return copy_nums[-1] < sum(copy_nums[:-1]  )


if __name__ == "__main__":
 import doctest

 doctest.testmod()









from __future__ import annotations

from fractions import Fraction

def     _SCREAMING_SNAKE_CASE    (							lowercase			: int			,							lowercase			: int  ):


      '''simple docstring'''



      return (
          num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
      )

def     _SCREAMING_SNAKE_CASE    (							lowercase			: int  ):


      '''simple docstring'''



      lowerCamelCase_	  =					[]
      lowerCamelCase_	  =					11
      lowerCamelCase_	  =					int('1' + '0' * digit_len  )
      for num in range(lowercase			,							lowercase  ):
            while den <= 99:
                  if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
                        if is_digit_cancelling(lowercase			,							lowercase  ):
                              solutions.append(f"""{num}/{den}"""  )
                  den += 1
            num += 1
            lowerCamelCase_	  =					10
      return solutions

def     _SCREAMING_SNAKE_CASE    (							lowercase			: int = 2  ):


      '''simple docstring'''



      lowerCamelCase_	  =					1.0
      for fraction in fraction_list(lowercase  ):
            lowerCamelCase_	  =					Fraction(lowercase  )
            result *= frac.denominator / frac.numerator
      return int(lowercase  )


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



