




def     _SCREAMING_SNAKE_CASE    (							lowercase			: dict  ):


      '''simple docstring'''



      lowerCamelCase_	  =					set()
      # To detect a back edge, keep track of vertices currently in the recursion stack
      lowerCamelCase_	  =					set()
      return any(
          node not in visited and depth_first_search(lowercase			,							lowercase			,							lowercase			,							lowercase  )
          for node in graph  )

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


      '''simple docstring'''



      visited.add(lowercase  )
      rec_stk.add(lowercase  )

      for node in graph[vertex]:
            if node not in visited:
                  if depth_first_search(lowercase			,							lowercase			,							lowercase			,							lowercase  ):
                        return True
            elif node in rec_stk:
                  return True

    # The node needs to be removed from recursion stack before function ends
      rec_stk.remove(lowercase  )
      return False


if __name__ == "__main__":
 from doctest import testmod

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



