






from math import isqrt, loga





def 					snake_case	(  lowerCamelCase       ):




	'''simple docstring'''







	__lowercase   							=	[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       ):
				__lowercase   							=	False

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





def 					snake_case	(  lowerCamelCase = 800_800					,	lowerCamelCase = 800_800       ):




	'''simple docstring'''







	__lowercase   							=	degree * loga(lowerCamelCase       )
	__lowercase   							=	int(lowerCamelCase       )
	__lowercase   							=	calculate_prime_numbers(lowerCamelCase       )

	__lowercase   							=	0
	__lowercase   							=	0
	__lowercase   							=	len(lowerCamelCase       ) - 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'''






def 					_a						(       _lowerCamelCase = 100 ) ->				int:



			"""simple docstring"""


			__snake_case					:      Any							      =     n * (n + 1) * (2 * n + 1) / 6
			__snake_case					:      List[Any]							      =     (n * (n + 1) / 2) ** 2
			return int(square_of_sum - sum_of_squares )


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


