


def 	__lowerCAmelCase   (SCREAMING_SNAKE_CASE )->  Optional[Any]:  # noqa: E741




      """simple docstring"""

      snake_case_	=				len(SCREAMING_SNAKE_CASE )
      snake_case_	=				0
      snake_case_	=				[0] * n
      snake_case_	=				[False] * n
      snake_case_	=				[False] * n

      def dfs(SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE ):
            if parent == root:
                  out_edge_count += 1
            snake_case_	=				True
            snake_case_	=				at

            for to in l[at]:
                  if to == parent:
                        pass
                  elif not visited[to]:
                        snake_case_	=				dfs(SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE )
                        snake_case_	=				min(low[at] , low[to] )

                        # AP found via bridge
                        if at < low[to]:
                              snake_case_	=				True
                        # AP found via cycle
                        if at == low[to]:
                              snake_case_	=				True
                  else:
                        snake_case_	=				min(low[at] , SCREAMING_SNAKE_CASE )
            return out_edge_count

      for i in range(SCREAMING_SNAKE_CASE ):
            if not visited[i]:
                  snake_case_	=				0
                  snake_case_	=				dfs(SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE , -1 , SCREAMING_SNAKE_CASE )
                  snake_case_	=				out_edge_count > 1

      for x in range(len(SCREAMING_SNAKE_CASE ) ):
            if is_art[x] is True:
                  print(SCREAMING_SNAKE_CASE )


# Adjacency list of graph
UpperCAmelCase      =   {
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}




compute_ap(data)



def 	__lowerCAmelCase   (SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE )->  int:




      """simple docstring"""

      return x if y == 0 else greatest_common_divisor(SCREAMING_SNAKE_CASE , x % y )






def 	__lowerCAmelCase   (SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE )->  int:




      """simple docstring"""

      return (x * y) // greatest_common_divisor(SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE )






def 	__lowerCAmelCase   (SCREAMING_SNAKE_CASE = 20 )->  int:




      """simple docstring"""

      snake_case_	=				1
      for i in range(1 , n + 1 ):
            snake_case_	=				lcm(SCREAMING_SNAKE_CASE , SCREAMING_SNAKE_CASE )
      return g


if __name__ == "__main__":
   print(f'''{solution() = }''')