
def 			lowerCamelCase_ (				lowerCamelCase__    ):
				assert (
				    isinstance(lowerCamelCase__	, lowerCamelCase__    ) and number_of_steps > 0
				), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
				if number_of_steps == 1:
								return 1
				lowerCamelCase_	,    lowerCamelCase_						=			1, 1
				for _ in range(number_of_steps - 1    ):
								lowerCamelCase_	,    lowerCamelCase_						=			current + previous, current
				return current


if __name__ == "__main__":
			import doctest

			doctest.testmod()




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





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				return sum(DIGITS_FIFTH_POWER[digit] for digit in str(lowerCamelCase__    )    )





def 			lowerCamelCase_ (				):
				return sum(
				    number
				    for number in range(1_0_0_0	, 1_0_0_0_0_0_0    )
				    if number == digits_fifth_powers_sum(lowerCamelCase__    )    )


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


