
"""simple docstring"""

from math import isqrt






def 							A						(    snake_case				:int		)				->     list[int]:
 __UpperCamelCase      =	[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		):
    __UpperCamelCase      =	False

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






def 							A						(    snake_case				:int = 1_0**8		)				->     int:
 __UpperCamelCase      =	calculate_prime_numbers(max_number // 2		)

 __UpperCamelCase      =	0
 __UpperCamelCase      =	0
 __UpperCamelCase      =	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 							A						(    snake_case				:int		)				->     bool:
 return sum(i for i in range(1    , number // 2 + 1		) if number % i == 0		) == number


if __name__ == "__main__":
      print("Program to check whether a number is a Perfect number or not...")
      UpperCamelCase     :    Union[str, Any]       =			int(input("Enter number: ").strip())
      print(f'''{number} is {"" if perfect(number) else "not "}a Perfect Number.''')



