






import math





def 				snake_case  (     lowerCamelCase				,  lowerCamelCase					):




	'''simple docstring'''







	__lowercase             =  len(lowerCamelCase					)
	__lowercase             =  int(math.floor(math.sqrt(lowerCamelCase					)					)					)
	__lowercase             =  0
	while arr[min(lowerCamelCase				,  lowerCamelCase					) - 1] < x:
		__lowercase             =  step
		step += int(math.floor(math.sqrt(lowerCamelCase					)					)					)
		if prev >= n:
			return -1

	while arr[prev] < x:
		__lowercase             =  prev + 1
		if prev == min(lowerCamelCase				,  lowerCamelCase					):
			return -1
	if arr[prev] == x:
		return prev
	return -1


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









from __future__ import annotations





def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	if not nums:
		return 0
	__lowercase             =  nums[0]
	__lowercase             =  0
	for num in nums[1:]:
		__lowercase       ,						__lowercase             =  (
		    max_excluding + num,
		    max(lowerCamelCase				,  lowerCamelCase					),
		)
	return max(lowerCamelCase				,  lowerCamelCase					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()

