


lowerCamelCase						=		{str(digit): digit**5 for digit in range(10)}






def 					lowerCamelCase_   (	_a	):




  """simple docstring"""






  return sum(DIGITS_FIFTH_POWER[digit] for digit in str(_a	)	)






def 					lowerCamelCase_   (	):




  """simple docstring"""






  return sum(
      number
      for number in range(1_000     ,       1_000_000	)
      if number == digits_fifth_powers_sum(_a	)	)


if __name__ == "__main__":
  print(solution())








from math import isqrt






def 					lowerCamelCase_   (	_a	):




		"""simple docstring"""






		lowerCAmelCase__       :      Dict   					= [True] * max_number
		for i in range(2     ,       isqrt(max_number - 1	) + 1	):
				if is_prime[i]:
						for j in range(i**2     ,       _a     ,       _a	):
								lowerCAmelCase__       :      int   					= False

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






def 					lowerCamelCase_   (	_a = 10**8	):




		"""simple docstring"""






		lowerCAmelCase__       :      Any   					= calculate_prime_numbers(max_number // 2	)

		lowerCAmelCase__       :      Tuple   					= 0
		lowerCAmelCase__       :      List[Any]   					= 0
		lowerCAmelCase__       :      Optional[int]   					= len(_a	) - 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() = }''')




