






"""simple docstring"""

from math import isqrt






def _lowerCAmelCase	(  __lowerCamelCase:int   ):

						'''simple docstring'''






						__magic_name__            =     [True] * max_number
						for i in range(2 ,						isqrt(max_number - 1   ) + 1   ):
												if is_prime[i]:
																		for j in range(i**2 ,						snake_case__ ,						snake_case__   ):
																								__magic_name__            =     False

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






def _lowerCAmelCase	(  __lowerCamelCase:int = 1_0**8   ):

						'''simple docstring'''






						__magic_name__            =     calculate_prime_numbers(max_number // 2   )

						__magic_name__            =     0
						__magic_name__            =     0
						__magic_name__            =     len(snake_case__   ) - 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() = }''')











"""simple docstring"""

def _lowerCAmelCase	(  __lowerCamelCase:int = 2_0_0_0_0_0_0   ):

						'''simple docstring'''






						__magic_name__            =     [0 for i in range(n + 1   )]
						__magic_name__            =     1
						__magic_name__            =     1

						for i in range(2 ,						int(n**0.5   ) + 1   ):
												if primality_list[i] == 0:
																		for j in range(i * i ,						n + 1 ,						__lowerCamelCase   ):
																								__magic_name__            =     1
						__magic_name__            =     0
						for i in range(__lowerCamelCase   ):
												if primality_list[i] == 0:
																		sum_of_primes += i
						return sum_of_primes


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



