



'''simple docstring'''




def 	_lowerCAmelCase      (  __snake_case  :			int = 2_00_00_00      )					->					int:
     __A						:			Optional[int]								=	[0 for i in range(n + 1      )]
     __A						:			Union[str, Any]								=	1
     __A						:			Optional[Any]								=	1

     for i in range(2			,							int(n**0.5      ) + 1      ):
          if primality_list[i] == 0:
               for j in range(i * i			,							n + 1			,							__snake_case      ):
                    __A						:			List[str]								=	1
     __A						:			Optional[Any]								=	0
     for i in range(__snake_case      ):
          if primality_list[i] == 0:
               sum_of_primes += i
     return sum_of_primes


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






'''simple docstring'''




lowercase__   :				Any      =   {'''a''': ['''c''', '''b'''], '''b''': ['''d''', '''e'''], '''c''': [], '''d''': [], '''e''': []}
lowercase__   :				List[Any]      =   ['''a''', '''b''', '''c''', '''d''', '''e''']






def 	_lowerCAmelCase      (  __snake_case  :			str			,							__snake_case  :			Tuple			,							__snake_case  :			int      )					->					Tuple:
     __A						:			List[str]								=	start
     # add current to visited
     visited.append(__snake_case      )
     __A						:			Optional[int]								=	edges[current]
     for neighbor in neighbors:
          # if neighbor not in visited, visit
          if neighbor not in visited:
               __A						:			int								=	topological_sort(__snake_case			,							__snake_case			,							__snake_case      )
    # if all neighbors visited add current to sort
     sort.append(__snake_case      )
     # if all vertices haven't been visited select a new one to visit
     if len(__snake_case      ) != len(__snake_case      ):
          for vertice in vertices:
               if vertice not in visited:
                    __A						:			Dict								=	topological_sort(__snake_case			,							__snake_case			,							__snake_case      )
    # return sort
     return sort


if __name__ == "__main__":
  lowercase__   :				Tuple      =   topological_sort('''a''', [], [])
  print(sort)