





from __future__ import annotations





def    __UpperCamelCase      (    a) ->List[str]:
					lowerCamelCase__       =       2
					lowerCamelCase__       =       []
					while i * i <= n:
										if n % i:
															i += 1
										else:
															n //= i
															factors.append(_lowerCAmelCase)
					if n > 1:
										factors.append(_lowerCAmelCase)
					return factors


if __name__ == "__main__":
						import doctest

						doctest.testmod()








A_												=     {str(digit): digit**5 for digit in range(1_0)}





def    __UpperCamelCase      (    a) ->int:
					return sum(DIGITS_FIFTH_POWER[digit] for digit in str(a))





def    __UpperCamelCase      (    ) ->int:
					return sum(
					    number
					    for number in range(1000,     1000000)
					    if number == digits_fifth_powers_sum(a))


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

