import math





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

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


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




def  _lowerCamelCase					(   a_				: int = 4_00_00_00):
			lowerCamelCase						:Dict						  =     [0, 1]
			lowerCamelCase						:Optional[Any]						  =     0
			while fib[i] <= n:
						fib.append(fib[i] + fib[i + 1])
						if fib[i + 2] > n:
									break
						i += 1
			lowerCamelCase						:Dict						  =     0
			for j in range(len(a_) - 1):
						if fib[j] % 2 == 0:
									total += fib[j]

			return total


if __name__ == "__main__":
			print(F'{solution() = }')



