from __future__ import annotations





def  _lowerCamelCase					(   a_				: list[int]						,			a_				: int):
			if len(a_) == 0:
						return False
			lowerCamelCase						:Optional[int]						  =     len(a_) // 2
			if a_list[midpoint] == item:
						return True
			if item < a_list[midpoint]:
						return binary_search(a_list[:midpoint]						,			a_)
			else:
						return binary_search(a_list[midpoint + 1 :]						,			a_)


if __name__ == "__main__":
			_UpperCamelCase           =							input("""Enter numbers separated by comma:\n""").strip()
			_UpperCamelCase           =							[int(item.strip()) for item in user_input.split(""",""")]
			_UpperCamelCase           =							int(input("""Enter the number to be found in the list:\n""").strip())
			_UpperCamelCase           =							"""""" if binary_search(sequence, target) else """not """
			print(F'{target} was {not_str}found in {sequence}')




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() = }')



