def 		snake_case__	(		lowercase							,				lowercase					):
   return x if y == 0 else greatest_common_divisor(lowercase							,				x % y					)
def 		snake_case__	(		lowercase							,				lowercase					):
   return (x * y) // greatest_common_divisor(lowercase							,				lowercase					)
def 		snake_case__	(		lowercase = 20					):
   lowerCAmelCase_:							Union[str, Any]       =	1
   for i in range(1							,				n + 1					):
      lowerCAmelCase_:							Any       =	lcm(lowercase							,				lowercase					)
   return g


if __name__ == "__main__":
 print(f'''{solution() = }''')
from math import isqrt
def 		snake_case__	(		lowercase					):
   lowerCAmelCase_:							List[str]       =	[True] * max_number
   for i in range(2							,				isqrt(max_number - 1					) + 1					):
      if is_prime[i]:
         for j in range(i**2							,				lowercase							,				lowercase					):
            lowerCAmelCase_:							Dict       =	False

   return [i for i in range(2							,				lowercase					) if is_prime[i]]
def 		snake_case__	(		lowercase = 10**8					):
   lowerCAmelCase_:							Union[str, Any]       =	calculate_prime_numbers(max_number // 2					)

   lowerCAmelCase_:							Tuple       =	0
   lowerCAmelCase_:							List[Any]       =	0
   lowerCAmelCase_:							Dict       =	len(lowercase					) - 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() = }''')