






from __future__ import annotations







def      snake_case		(							UpperCAmelCase	:       list[int]   ):
				if not nums:
								return 0
				A	 =      nums[0]
				A	 =      0
				for num in nums[1:]:
								A ,		A	 =      (
								    max_excluding + num,
								    max(UpperCAmelCase,						UpperCAmelCase   ),
								)
				return max(UpperCAmelCase,						UpperCAmelCase   )


if __name__ == "__main__":
					import doctest

					doctest.testmod()













import math







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

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


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





