



'''simple docstring'''






# Author: OMKAR PATHAK, Nwachukwu Chidiebere

# Use a Python dictionary to construct the graph.
from __future__ import annotations

from pprint import pformat
from typing import Generic, TypeVar

lowerCAmelCase:      Optional[int]		 =		TypeVar('T')

class 							a__(      Generic[T]			):







    def __init__(   self				:						str		,    __snake_case				:						bool = True			):
      a		:      dict[T, list[T]]       =  {}  # dictionary of lists
      a		:      List[str]       =  directed







    def     lowercase_ (   self				:						Any		,    __snake_case				:						T		,    __snake_case				:						T			):

      if not self.directed:  # For undirected graphs
        # if both source vertex and destination vertex are both present in the
        # adjacency list, add destination vertex to source vertex list of adjacent
        # vertices and add source vertex to destination vertex list of adjacent
        # vertices.
        if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(__snake_case			)
          self.adj_list[destination_vertex].append(__snake_case			)
        # if only source vertex is present in adjacency list, add destination vertex
        # to source vertex list of adjacent vertices, then create a new vertex with
        # destination vertex as key and assign a list containing the source vertex
        # as it's first adjacent vertex.
        elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(__snake_case			)
          a		:      List[str]       =  [source_vertex]
        # if only destination vertex is present in adjacency list, add source vertex
        # to destination vertex list of adjacent vertices, then create a new vertex
        # with source vertex as key and assign a list containing the source vertex
        # as it's first adjacent vertex.
        elif destination_vertex in self.adj_list:
          self.adj_list[destination_vertex].append(__snake_case			)
          a		:      List[Any]       =  [destination_vertex]
        # if both source vertex and destination vertex are not present in adjacency
        # list, create a new vertex with source vertex as key and assign a list
        # containing the destination vertex as it's first adjacent vertex also
        # create a new vertex with destination vertex as key and assign a list
        # containing the source vertex as it's first adjacent vertex.
        else:
          a		:      Optional[int]       =  [destination_vertex]
          a		:      List[str]       =  [source_vertex]
      else:  # For directed graphs
        # if both source vertex and destination vertex are present in adjacency
        # list, add destination vertex to source vertex list of adjacent vertices.
        if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(__snake_case			)
        # if only source vertex is present in adjacency list, add destination
        # vertex to source vertex list of adjacent vertices and create a new vertex
        # with destination vertex as key, which has no adjacent vertex
        elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(__snake_case			)
          a		:      str       =  []
        # if only destination vertex is present in adjacency list, create a new
        # vertex with source vertex as key and assign a list containing destination
        # vertex as first adjacent vertex
        elif destination_vertex in self.adj_list:
          a		:      int       =  [destination_vertex]
        # if both source vertex and destination vertex are not present in adjacency
        # list, create a new vertex with source vertex as key and a list containing
        # destination vertex as it's first adjacent vertex. Then create a new vertex
        # with destination vertex as key, which has no adjacent vertex
        else:
          a		:      List[Any]       =  [destination_vertex]
          a		:      Dict       =  []

      return self







    def __repr__(   self				:						Union[str, Any]			):
      return pformat(self.adj_list			)




'''simple docstring'''






def    lowerCamelCase__ (		_A = 6008_5147_5143       ):

  try:
    a		:      Optional[int]       =  int(_A       )
  except (TypeError, ValueError):
    raise TypeError('Parameter n must be int or castable to int.'       )
  if n <= 0:
    raise ValueError('Parameter n must be greater than or equal to one.'       )
  a		:      Any       =  1
  a		:      Union[str, Any]       =  2
  while i * i <= n:
    while n % i == 0:
      a		:      str       =  i
      n //= i
    i += 1
  if n > 1:
    a		:      Any       =  n
  return int(_A       )


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