
def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			[0] * len(lowerCamelCase__    )

				for i in range(1	, len(lowerCamelCase__    )    ):
								# use last results for better performance - dynamic programming
								lowerCamelCase_						=			prefix_result[i - 1]
								while j > 0 and input_string[i] != input_string[j]:
												lowerCamelCase_						=			prefix_result[j - 1]

								if input_string[i] == input_string[j]:
												j += 1
								lowerCamelCase_						=			j

				return prefix_result





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				return max(prefix_function(lowerCamelCase__    )    )


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())


