
'''simple docstring'''

def 	_snake_case						(      A_       :    Optional[int]   ):
  """simple docstring"""







  a_      :	Any      =							set()
  # To detect a back edge, keep track of vertices currently in the recursion stack
  a_      :	List[Any]      =							set()
  return any(
      node not in visited and depth_first_search(a__     ,		a__     ,		a__     ,		a__   )
      for node in graph   )






def 	_snake_case						(      A_       :    List[str]     ,		A_       :    Tuple     ,		A_       :    Union[str, Any]     ,		A_       :    Tuple   ):
  """simple docstring"""







  visited.add(a__   )
  rec_stk.add(a__   )

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

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


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

    testmod()




'''simple docstring'''

from __future__ import annotations






def 	_snake_case						(      A_       :    int   ):
  """simple docstring"""







  a_      :	Optional[Any]      =							2
  a_      :	int      =							[]
  while i * i <= n:
    if n % i:
      i += 1
    else:
      n //= i
      factors.append(A_   )
  if n > 1:
    factors.append(A_   )
  return factors


if __name__ == "__main__":
    import doctest

    doctest.testmod()


