





'''simple docstring'''




from math import isqrt, loga




def 						__lowerCamelCase			(	UpperCAmelCase_							)   ->list[int]:
	snake_case__	       =   [True] * max_number
	for i in range(2					,				isqrt(max_number - 1							) + 1							):
		if is_prime[i]:
			for j in range(i**2					,				UpperCAmelCase_					,				UpperCAmelCase_							):
				snake_case__	       =   False

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




def 						__lowerCamelCase			(	UpperCAmelCase_ = 80_08_00					,				UpperCAmelCase_ = 80_08_00							)   ->int:
	snake_case__	       =   degree * loga(UpperCAmelCase_							)
	snake_case__	       =   int(UpperCAmelCase_							)
	snake_case__	       =   calculate_prime_numbers(UpperCAmelCase_							)

	snake_case__	       =   0
	snake_case__	       =   0
	snake_case__	       =   len(UpperCAmelCase_							) - 1
	while left < right:
		while (
		    prime_numbers[right] * loga(prime_numbers[left]							)
		    + prime_numbers[left] * loga(prime_numbers[right]							)
		    > upper_bound
		):
			right -= 1
		hybrid_integers_count += right - left
		left += 1

	return hybrid_integers_count


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










'''simple docstring'''




from abc import ABC, abstractmethod
from argparse import ArgumentParser






class 				__snake_case     (					__magic_name__							):





	@staticmethod
	@abstractmethod
	def   _snake_case   (		UpperCamelCase_		)      ->		Dict:
		raise NotImplementedError()





	@abstractmethod
	def   _snake_case   (		self		)      ->		List[Any]:
		raise NotImplementedError()



