


'''simple docstring'''




import math

def 			__UpperCamelCase    (    _A    :				Optional[int]					,   _A    :				int				)    ->      int:




	"""simple docstring"""





	lowerCAmelCase					:    List[str]      							= len(lowerCamelCase_				)
	lowerCAmelCase					:    Optional[int]      							= int(math.floor(math.sqrt(lowerCamelCase_				)				)				)
	lowerCAmelCase					:    List[str]      							= 0
	while arr[min(lowerCamelCase_					,   lowerCamelCase_				) - 1] < x:
		lowerCAmelCase					:    Tuple      							= step
		step += int(math.floor(math.sqrt(lowerCamelCase_				)				)				)
		if prev >= n:
			return -1

	while arr[prev] < x:
		lowerCAmelCase					:    int      							= prev + 1
		if prev == min(lowerCamelCase_					,   lowerCamelCase_				):
			return -1
	if arr[prev] == x:
		return prev
	return -1


if __name__ == "__main__":
				_lowerCAmelCase  :		Tuple		     =	input('Enter numbers separated by a comma:\n').strip()
				_lowerCAmelCase  :		Any		     =	[int(item) for item in user_input.split(',')]
				_lowerCAmelCase  :		List[str]		     =	int(input('Enter the number to be searched:\n'))
				_lowerCAmelCase  :		Tuple		     =	jump_search(arr, x)
				if res == -1:
								print('Number not found!')
				else:
								print(f"""Number {x} is at index {res}""")





'''simple docstring'''




_lowerCAmelCase  :		List[str]		     =	{str(digit): digit**5 for digit in range(10)}

def 			__UpperCamelCase    (    _A    :				int				)    ->      int:




	"""simple docstring"""





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

def 			__UpperCamelCase    (    )    ->      int:




	"""simple docstring"""





	return sum(
	    number
	    for number in range(10_00					,   1_00_00_00				)
	    if number == digits_fifth_powers_sum(_A				)				)


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