
from math import isqrt




def 	_SCREAMING_SNAKE_CASE					(		_lowerCamelCase :			int)					->    list[int]:






							'''simple docstring'''





							__UpperCamelCase	:   List[Any]			   =					[True] * max_number
							for i in range(2						,  isqrt(max_number - 1) + 1):
														if is_prime[i]:
																					for j in range(i**2						,  _lowerCamelCase						,  _lowerCamelCase):
																												__UpperCamelCase	:   Tuple			   =					False

							return [i for i in range(2						,  _lowerCamelCase) if is_prime[i]]




def 	_SCREAMING_SNAKE_CASE					(		_lowerCamelCase :			int = 10**8)					->    int:






							'''simple docstring'''





							__UpperCamelCase	:   List[Any]			   =					calculate_prime_numbers(max_number // 2)

							__UpperCamelCase	:   str			   =					0
							__UpperCamelCase	:   str			   =					0
							__UpperCamelCase	:   str			   =					len(_lowerCamelCase) - 1
							while left <= right:
														while prime_numbers[left] * prime_numbers[right] >= max_number:
																					right -= 1
														semiprimes_count += right - left + 1
														left += 1

							return semiprimes_count


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

class  lowerCamelCase__							:




	'''simple docstring'''




	def __init__(					self		:int						)		-> Dict:
								__UpperCamelCase	:   Union[str, Any]			   =					{}







	def    _lowerCamelCase				(					self		:str						)		-> None:
								print(self.vertex						)
								for i in self.vertex:
															print(a     ,   " -> "     ,   " -> ".join([str(a						) for j in self.vertex[i]]						)						)







	def    _lowerCamelCase				(					self		:List[Any]     ,   a		:int     ,   a		:int						)		-> None:
								# check if vertex is already present,
								if from_vertex in self.vertex:
															self.vertex[from_vertex].append(a						)
								else:
															# else make a new vertex
															__UpperCamelCase	:   Optional[Any]			   =					[to_vertex]







	def    _lowerCamelCase				(					self		:Tuple						)		-> None:
								# visited array for storing already visited nodes
								__UpperCamelCase	:   Dict			   =					[False] * len(self.vertex						)

								# call the recursive helper function
								for i in range(len(self.vertex						)						):
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)







	def    _lowerCamelCase				(					self		:Any     ,   a		:int     ,   a		:list						)		-> None:
								# mark start vertex as visited
								__UpperCamelCase	:   int			   =					True

								print(a     ,   end=" "						)

								# Recur for all the vertices that are adjacent to this node
								for i in self.vertex:
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)


if __name__ == "__main__":
		lowercase  :					Dict													=       Graph()
		g.add_edge(0, 1)
		g.add_edge(0, 2)
		g.add_edge(1, 2)
		g.add_edge(2, 0)
		g.add_edge(2, 3)
		g.add_edge(3, 3)

		g.print_graph()
		print('DFS:')
		g.dfs()

		# OUTPUT:
		# 0  ->  1 -> 2
		# 1  ->  2
		# 2  ->  0 -> 3
		# 3  ->  3
		# DFS:
		#  0 1 2 3